#aising2019e. [aising2019_e]Attack to a Tree
[aising2019_e]Attack to a Tree
Problem Statement
The server in company A has a structure where devices numbered are connected with cables. The -th cable connects Device and Device . Any two different devices are connected through some number of cables.
Each device () has a non-zero integer , which represents the following:
- If , Device is a computer that consumes an electric power of .
- If , Device is a battery that supplies an electric power of .
You have decided to disconnect some number of cables (possibly zero) to disable the server. When some cables are disconnected, the devices will be divided into some number of connected components. The server will be disabled if all of these connected components satisfy one of the following conditions:
- There is no computer in the connected component. That is, is positive for every device that belongs to the connected component.
- There is not enough supply of electric power in the connected component. That is, the sum of over all devices that belong to the connected component is negative.
At least how many cables do you need to disconnect in order to disable the server?
Constraints
- ()
- ()
- ()
- Any two different devices are connected through some number of cables.
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the answer.
Sample Input 1
7
-2 7 5 6 -8 3 4
1 2
2 3
2 4
1 5
5 6
5 7
Sample Output 1
1
We should disconnect the cable connecting Device and Device .
Sample Input 2
4
1 2 3 4
1 2
1 3
1 4
Sample Output 2
0
Sample Input 3
6
10 -1 10 -1 10 -1
1 2
2 3
3 4
4 5
5 6
Sample Output 3
5
Sample Input 4
8
-2 3 6 -2 -2 -5 3 2
3 4
7 6
6 2
8 2
5 3
1 8
3 7
Sample Output 4
3
Sample Input 5
10
3 4 9 6 1 5 -1 10 -10 -10
7 4
5 6
8 1
9 5
7 1
10 3
2 8
4 10
9 2
Sample Output 5
3