IITWPC4I  Petya and the Road Repairs
Petya is the mayor of a city named Mayapur. In the morning, everybody likes to drink hot tea in bed, and the citizens need milk to take with their tea. For this purpose, they should be able to reach at least some milkman in the city. There are m bidirectional roads in the city but all of them are currently unrepaired, hence not in a state of use.
Petya cares about his city a lot and intends to repair some of these roads, so that every citizen is connected to at least one milkman. For repairing each road he needs to pay a cost. He would like to minimize the cost of this project. Note that a milkman does not need to go to some other milkman for milk as he can take milk from himsaelf.
Help Petya in finding out the minimum cost needed to repair the roads in the given way. If it is not possible for a citizen to connect to any of the milkmen, output "impossible" (without quotes).
Input
The first line contains T: the number of test cases. (1 <= T <= 100)
For each test case, the first line contains two spaceseperated numbers n, m: n is the number of citizens in Mayapur and m denotes the number of unrepaired roads (1 <= n <= 10^5, 1 <= m <= min (n * (n  1) / 2, 2 * 10^5)).
The next line contains n spaceseparated integers, which are either 0 or 1, denoting for successive citizens whether they are a milkman or not.
Then, for each of the next m lines, each line contains three spaceseperated integers u, v and c, denoting that there exists a unrepaired road between u and v such that the cost of repairing of road is c. (1 <= u, v <= n and u != v, 1 <= c <= 10^9.)
Output
For each test case output the cost as required.
Example
Input: 1 5 7 0 1 0 1 0 1 2 11 1 3 1 1 5 17 2 3 1 3 5 18 4 5 3 2 4 5 Output: 5
hide comments
sobriquet:
20141008 13:26:21
A must problem for learning disjoint data sets. 

praveen123:
20140204 18:42:36
@Rachit: Thank you, updated :) 

Jacob Plachta:
20140204 18:42:05
Thanks, that's indeed what I needed to know. 

રચિત (Rachit):
20140204 18:42:05
I guess there is one line missing. 'If it is not possible for a citizen to connect to any of the milkmen, output "impossible" (without quotes).' @praveen123 can you please look into this? 

Jacob Plachta:
20140204 18:42:05
Ummm, there exists a case in which there are no milkmen (which is undefined by the problem), and I can't even figure out what the correct output for that case is (it's not 0, 1, or the cost to connect everyone). 
Added by:  praveen123 
Date:  20140203 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  IITK ACA CSE online judge 