B"A club plans to hold a party and will invite some of its n members. The n members are identified by the numbers 1, 2, ... , n . If member i is not invited, the party will gain an unhappiness value of a_i . There are m pairs of friends among the n members. As per tradition, if both people from a friend pair are invited, they will share a cake at the party. The total number of cakes eaten will be equal to the number of pairs of friends such that both members have been invited. However, the club's oven can only cook two cakes at a time. So, the club demands that the total number of cakes eaten is an even number. What is the minimum possible total unhappiness value of the party, respecting the constraint that the total number of cakes eaten is even? Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= q t <= q 10^4 ). The description of the test cases follows. The first line of each test case contains two integers n and m ( 1 <= q n <= q 10^5 , 0 <= q m <= q min(10^5, frac{n(n-1)}{2}) ) -- the number of club members and pairs of friends. The second line of each test case contains n integers a_1,a_2, ... ,a_n ( 0 <= q a_i <= q 10^4 ) -- the unhappiness value array. Each of the next m lines contains two integers x and y ( 1 <= q x,y <= q n , x neq y ) indicating that x and y are friends. Each unordered pair (x,y) appears at most once in each test case. It is guaranteed that both the sum of n and the sum of m over all test cases do not exceed 10^5 . For each test case, print a line containing a single integer xe2 x80 x93 the minimum possible unhappiness value of a valid party. In the first test case, all members can be invited. So the unhappiness value is 0 . In the second test case, the following options are possible: In the third test case, inviting members 3,4,5$"...