

PondsTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 6614 Accepted Submission(s): 1822 Problem Description Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value $v$. Now Betty wants to remove some ponds because she does not have enough money. But each time when she removes a pond, she can only remove the ponds which are connected with less than two ponds, or the pond will explode. Note that Betty should keep removing ponds until no more ponds can be removed. After that, please help her calculate the sum of the value for each connected component consisting of a odd number of ponds Input The first line of input will contain a number $T (1 \leq T \leq 30)$ which is the number of test cases. For each test case, the first line contains two number separated by a blank. One is the number $p (1 \leq p \leq 10^4)$ which represents the number of ponds she owns, and the other is the number $m (1 \leq m \leq 10^5)$ which represents the number of pipes. The next line contains $p$ numbers $v_1, . . . , v_p$, where $v_i (1 \leq v_i \leq 10^8)$ indicating the value of pond $i$. Each of the last $m$ lines contain two numbers $a$ and $b$, which indicates that pond $a$ and pond $b$ are connected by a pipe. Output For each test case, output the sum of the value of all connected components consisting of odd number of ponds after removing all the ponds connected with less than two pipes. Sample Input
Sample Output
Source  
