There are multiple test cases in the input file. Each test case starts with two integers N and M , (1<=N<=100000, 1<=M<=1000000) , the number of universities and the number of direct communication line set up by the committee, respectively. Universities are numbered from 1 to N . The next line has N integers; the Kth integer is equal to the number of students in university numbered K. The number of students in any university does not exceed 100000000. Each of the following M lines has two integers s , t , and describes a communication line connecting university s and university t . All communication lines of this new system are bidirectional.
N = 0, M = 0 indicates the end of input and should not be processed by your program.