B"You've probably heard about the twelve labors of Heracles, but do you have any idea about the thirteenth? It is commonly assumed it took him a dozen years to complete the twelve feats, so on average, a year to accomplish every one of them. As time flows faster these days, you have minutes rather than months to solve this task. But will you manage? In this problem, you are given a tree with n weighted vertices. A tree is a connected graph with n - 1 edges. Let us define its k -coloring as an assignment of k colors to the edges so that each edge has exactly one color assigned to it. Note that you don't have to use all k colors. A subgraph of color x consists of these edges from the original tree, which are assigned color x , and only those vertices that are adjacent to at least one such edge. So there are no vertices of degree 0 in such a subgraph. The value of a connected component is the sum of weights of its vertices. Let us define the value of a subgraph as a maximum of values of its connected components. We will assume that the value of an empty subgraph equals 0 . There is also a value of a k -coloring, which equals the sum of values of subgraphs of all k colors. Given a tree, for each k from 1 to n - 1 calculate the maximal value of a k -coloring. In the first line of input, there is a single integer t ( 1 <= q t <= q 10^5 ) denoting the number of test cases. Then t test cases follow. First line of each test case contains a single integer n ( 2 <= q n <= q 10^5 ). The second line consists of n integers w_1, w_2, ... , w_n ( 0 <= q w_i <= q 10^9 ), w_i equals the weight of i -th vertex. In each of the following n - 1 lines, there are two integers u , v ( 1 <= q u,v <= q n ) describing an edge between vertices u and v . It is guaranteed that these edges form a tree. The sum of n$$"...