B'You are given a tree consisting of n vertices. There is an integer written on each vertex; the i -th vertex has integer a_i written on it. You have to process q queries. The i -th query consists of three integers x_i , y_i and k_i . For this query, you have to answer if it is possible to choose a set of vertices v_1, v_2, ... , v_m (possibly empty) such that: The first line contains one integer n ( 2 <= n <= 2 cdot 10^5 ). The second line contains n integers a_1, a_2, ... , a_n ( 0 <= a_i <= 2^{20} - 1 ). Then n-1 lines follow. Each of them contains two integers u and v ( 1 <= u, v <= n ; u ne v ) denoting an edge of the tree. The next line contains one integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of queries. Then q lines follow. The i -th of them contains three integers x_i , y_i and k_i ( 1 <= x_i, y_i <= n ; 0 <= k_i <= 2^{20} - 1 ). For each query, print YES if it is possible to form a set of vertices meeting the constraints. Otherwise, print NO. You can print each letter in any case. '...