The first line of the input will contain $N$ (1 ≤ $N$ ≤ 100000), the number of nodes. The second line will contain $N$ numbers, the $i-th$ number, representing the value[i] (1 ≤ $value[i]$ ≤ 30000). Each of the next $N - 1$ lines will contain a pair of nodes $(u, v)$, each representing an edge of the tree.
For tests worth $20$ points (1 ≤ $N$ ≤ 1000)

For tests worth $20$ more points, value[i] = value[ 1 ] for $i = 1, 2,...n$

For tests worth $20$ more points, value[i] = value[1] for $i = 1, 2,...n$

h2. Date de ieşire