B'You are given a rooted tree consisting of n vertices. The vertex 1 is the root. Each vertex has an integer written on it; this integer is val_i for the vertex i . You are given q queries to the tree. The i -th query is represented by two vertices, u_i and v_i . To answer the query, consider all vertices w that lie in the subtree of u_i or v_i (if a vertex is in both subtrees, it is counted twice). For all vertices in these two subtrees, list all integers written on them, and find the integer with the maximum number of occurrences. If there are multiple integers with maximum number of occurrences, the minimum among them is the answer. The first line contains one integer n ( 1 <= n <= 2 cdot 10^5 ) -- the number of vertices in the tree. The second line contains n integers val_1, val_2, ... , val_n ( 1 <= val_i <= 2 cdot 10^5 ) -- the numbers written on the vertices. Then n - 1 lines follow, each containing two integers x and y ( 1 <= x, y <= n ) representing an edge between vertices x and y . These edges form a tree. The next line contains one integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of queries to process. Then q lines follow. The i -th of them containing two numbers u_i and v_i ( 1 <= u_i, v_i <= n ) -- the roots of subtrees in the i -th query. For each query, print one integer -- the number that has the maximum amount of occurrences in the corresponding pair of subtrees (if there are multiple such numbers, print the minimum one among them). In the 1 -st query, the pair of subtrees consists of vertices [2, 4, 7, 8] , and the numbers written on them are {1, 2, 2, 4 } . The number 2 occurs twice, all other numbers -- at most once, so the answer is 2 . In the 2 -nd query, the pair of subtrees consists of vertices [3, 5, 6, 7, 7, 8, 8]$$'...