The city of Hotham is once again attacked by its most prominent villain, the Jester. This time his target is Hotham’s water supply. The fresh water of Hotham is stored in N reservoirs, which are connected by a set of M pipes. There is at least one path (potentially consisting of several pipes) from any reservoir to any other reservoir. Moreover, every pipe connects two different reservoirs, and there is at most one pipe between any pair of reservoirs.

The Jester has breached some of the pipes and has been draining water from them. Following his playful nature, the Jester ensured that water drained from any one pipe amounts to an even number of cubic meters per second (m3=s). If 2d m3=s of water is drained from a pipe joining reservoirs u and v, then u and v lose d m3=s of water each.

To make matters more confusing, the Jester actually pumps water into some of the breached pipes instead of draining from them. Again, the water pumped into any one pipe is an even number of m3=s. If 2p m3=s of water is pumped into a pipe joining reservoirs u and v, then u and v gain p m3=s of water each. The net change of water volume in each reservoir is the total sum of gains and losses acquired from the pipes connected to it. Formally, if a reservoir is connected to pipes from which 2d1, 2d2, . . . , 2da m3=s of water is drained and to pipes into which 2p1, 2p2, . . . , 2pb m3=s of water is pumped, then the net change of water volume in this reservoir is p1+p2+: : :+pbd1d2: : :da. The mayor of Hotham has installed sensors in the reservoirs, but not in the pipes. Therefore, he can observe the net change of water in each reservoir but does not how much water is drained from or pumped into each pipe.

Your task is to write a program that helps the mayor. Given full information about the reservoir network and the net changes in each reservoir, your program should decide if this information is enough to uniquely determine the Jester’s plan. The plan can be determined uniquely if there is exactly one possibility for how much water is drained from or pumped into each pipe. Note that these amounts of water need not be the same for all pipes. If there is exactly one possibility, your program should print it.

입력

• The first line of the input contains two integers: N, the number of reservoirs in Hotham, and M, the number of pipes.
• The following N lines contain an integer ci each: the net change in reservoir i (1 <= i <= N). Line i of these N lines contains ci .
• The following M lines contain two integers ui and vi each (1 <= i <= M). Each such line indicates that there is a pipe between resevoirs ui and vi (1 <= ui, vi <= N). Line i of these M lines contains ui and vi.

출력

입출력 예

입력

4 3
-1
1
-3
1
1 2
1 3
1 4

출력

2
-6
2

입력

4 5
1
2
1
2
1 2
2 3
3 4
4 1
1 3

출력

0

Constraints

• 1 <= N <= 100000
• 1 <= M <= 500000
• 10^9 <= ci <= 10^9
• If the Jester’s plan can be determined uniquely, 10^9 <= xi <= 10^9 .
• In test cases worth 30 points, the water network of Hotham is a tree.

출처:boi/2013/