Power Tree

给定一棵 $n$ 个点的有根树，$1$ 为根。定义 $u$ 为叶子当且仅当它**不是根**且度数为 $1$。 你可以选择花费 $w_i$ 的代价控制点 $i$。当一个点 $i$ 被控制时你可以选择给它的子树内的叶子的点权都加上一个自己选定的值 $v_i$ 。你需要控制若干个点，使得花费的代价尽量少，且无论怎样规定所有叶子的初始点权，都可以通过调整你选择的点的值 $v_i$ 来让所有叶子的点权变为 $0$。 **输出格式** 你需要输出最小代价和并构造**所有**最优选取方案的**并集**。 $n\le 2\times 10^5$。

You are given a rooted tree with $ n $ vertices, the root of the tree is the vertex $ 1 $ . Each vertex has some non-negative price. A leaf of the tree is a non-root vertex that has degree $ 1 $ . Arkady and Vasily play a strange game on the tree. The game consists of three stages. On the first stage Arkady buys some non-empty set of vertices of the tree. On the second stage Vasily puts some integers into all leaves of the tree. On the third stage Arkady can perform several (possibly none) operations of the following kind: choose some vertex $ v $ he bought on the first stage and some integer $ x $ , and then add $ x $ to all integers in the leaves in the subtree of $ v $ . The integer $ x $ can be positive, negative of zero. A leaf $ a $ is in the subtree of a vertex $ b $ if and only if the simple path between $ a $ and the root goes through $ b $ . Arkady's task is to make all integers in the leaves equal to zero. What is the minimum total cost $ s $ he has to pay on the first stage to guarantee his own win independently of the integers Vasily puts on the second stage? Also, we ask you to find all such vertices that there is an optimal (i.e. with cost $ s $ ) set of vertices containing this one such that Arkady can guarantee his own win buying this set on the first stage.

The first line contains a single integer $ n $ ( $ 2 \le n \le 200\,000 $ ) — the number of vertices in the tree. The second line contains $ n $ integers $ c_1, c_2, \ldots, c_n $ ( $ 0 \le c_i \le 10^9 $ ), where $ c_i $ is the price of the $ i $ -th vertex. Each of the next $ n - 1 $ lines contains two integers $ a $ and $ b $ ( $ 1 \le a, b \le n $ ), denoting an edge of the tree.

In the first line print two integers: the minimum possible cost $ s $ Arkady has to pay to guarantee his own win, and the number of vertices $ k $ that belong to at least one optimal set. In the second line print $ k $ distinct integers in increasing order the indices of the vertices that belong to at least one optimal set.

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

4 3
2 4 5 

3
1 1 1
1 2
1 3

2 3
1 2 3 

In the second example all sets of two vertices are optimal. So, each vertex is in at least one optimal set.