B'Bakry faced a problem, but since he 's lazy to solve it, he asks for your help. You are given a tree of n nodes, the i -th node has value a_i assigned to it for each i from 1 to n . As a reminder, a tree on n nodes is a connected graph with n-1 edges. You want to delete at least 1 , but at most k-1 edges from the tree, so that the following condition would hold: For every connected component calculate the bitwise XOR of the values of the nodes in it. Then, these values have to be the same for all connected components. Is it possible to achieve this condition? Each test contains multiple test cases. The first line contains the number of test cases t (1 <= q t <= q 5 cdot 10^4) . Description of the test cases follows. The first line of each test case contains two integers n and k (2 <= q k <= q n <= q 10^5) . The second line of each test case contains n integers a_1, a_2, ..., a_n (1 <= q a_i <= q 10^9) . The i -th of the next n-1 lines contains two integers u_i and v_i ( 1 <= q u_i, v_i <= q n , u_i neq v_i ), which means that there 's an edge between nodes u_i and v_i . It is guaranteed that the given graph is a tree. It is guaranteed that the sum of n over all test cases doesn 't exceed 2 cdot 10^5 . For each test case, you should output a single string. If you can delete the edges according to the conditions written above, output "YES" (without quotes). Otherwise, output "NO" (without quotes). You can print each letter of "YES" and "NO" in any case (upper or lower). It can be shown that the objection is not achievable for first, third, and fifth test cases. In the second test case, you can just remove all the edges. There will be 5 connected components, each containing only one node with value 3 , so the bitwise XORs will be 3 for all of them. In the fourth test case, this is the tree:'...