GREED  Greedy island
Gon is on Greedy island. He wants to go home. But to get the ticket to leave the game, he has to get N cards labeled in a sequence from 1 to N (the order of the cards in his hand is irrelevant). He already has N cards, but not forming a sequence from 1 to N. So he wants you to help him. For some cards, he can change one card for another for one piece of gold. Help him to get the ticket at the minimum cost (using the minimum number of exchanges).
Input
The first line contains t, the number of tests (1<=t<=10). For each test case:
 the number of cards N is given is given in the first line (2<=N<=500).
 the next N lines contain the N cards owned by Gon.
 the following line contains e, the number of different allowed types of exchanges.
 the next e lines contain two integers x_{i},y_{i} each which mean that we can exchange and replace the card marked x by the card marked y and vice versa.
There is a blank line after each test case.
Output
For each test case, output a line denoting the minimum required cost.
Example
Input: 1 4 1 2 2 2 2 2 3 3 4 Output: 3
hide comments
Abdelrahman Atia:
20170314 21:14:16


paras meena:
20151105 05:49:59
HunterXHunter :D (y) 

Deepak Gupta:
20141107 18:28:53
numbers on cards seem to be >500


Ghost Of Perdition:
20130902 21:06:56
can you swap between two cards in your hand? and what is the cost? 

Rocker3011:
20130115 03:38:57
i thought a problem about HunterxHunter and greed island... but someone beated me, 8 years before 

NoszĂˇly Csaba:
20110823 19:13:16
@~neo~


~neo~:
20110803 14:22:10
can anyone explain the above test case..!! 
Added by:  Le Trong Dao 
Date:  20050608 
Time limit:  50s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  Mr.Tran Minh Quan 