HDU 5834 Magic boy Bi Luo with his excited tree__hdu

Problem Description Bi Luo is a magic boy, him also has a migic tree, the tree has N nodes, at each node, there is a Tre Asure, it ' s value is v[i], with for each edge, there be a cost c[i], which means, every Ed to pay C[i].

You could attention that every v[i] can is taken only once, but for some c[i], your may cost severial times.

Now, the Bi Luo define Ans[i] as the most value can bi Luo gets if bi Luo starts at node i.

Bi Luo is also a excited boy, now him wants to know every], can you help ans[i?
Input a positive integer t (t≤104), represents there are t test cases.

Four each test:

The contain an integer N (n≤105).

The next line contains N integers v[i], which means the treasure ' s value of node I (1≤v[i]≤104).

For the next