There is an undirected tree with root (1) where each vertex has a weight (w_i\in\{1,-1\}). A volcano at the root erupts at time (0). At time (t), lava floods all vertices whose distance from the root is at most (t), where the distance is the number of edges in the shortest path between the two vertices. At time (0), you are at vertex (st) with life value (S), initially (S=1). Starting at time (0) (including time (0)), the following events happen in order at each time stamp: Let (u) be the vertex you are currently at. Your life value increases by (w_u), i.e., (S\gets S+w_u). If (S=0) or if vertex (u) is flooded with lava at this time, you die immediately. You must move to an adjacent vertex (includes father and sons; staying in place is not allowed). You arrive at the chosen vertex at the next time stamp. Find the maximum number of moves you can make before you die. Each test contains multiple test cases. The first line contains the number of test cases (T) ((1 \le T \le 10^4)). The description of the test cases follows. For each test case, the first line contains two integers (n,st) ((2 \le st \le n \le 5\cdot 10^5)), denoting the number of vertices and the vertex you start at at time stamp (0). The second line contains (n) integers (w_1, w_2, \ldots, w_n) ((w_i\in\{1,-1\}),(w_{st}=1)), where (w_i) represents the weight of the vertex (i). The next (n-1) lines each contain two integers (u,v) ((1\le u,v \le n)), which describe a pair of vertices connected by an edge. It is guaranteed that the given graph is a tree and the sum of (n) over all test cases does not exceed (10^6). For each test case, output a line with an integer indicating the maximum number of moves you can make. Here is a picture that shows the tree in the first test case. One of the optimal sequence of moves is (4\to3\to4\to5\to6\to7\to6), which makes (6) mov