B'There is an undirected, connected graph with n vertices and m weighted edges. A walk from vertex u to vertex v is defined as a sequence of vertices p_1,p_2, ldots,p_k (which are not necessarily distinct) starting with u and ending with v , such that p_i and p_{i+1} are connected by an edge for 1 <= q i < k . We define the length of a walk as follows: take the ordered sequence of edges and write down the weights on each of them in an array. Now, write down the bitwise AND of every nonempty prefix of this array. The length of the walk is the MEX of all these values. More formally, let us have [w_1,w_2, ldots,w_{k-1}] where w_i is the weight of the edge between p_i and p_{i+1} . Then the length of the walk is given by mathrm{MEX}( {w_1, ,w_1 & w_2, , ldots, ,w_1 & w_2 & ldots & w_{k-1} }) , where & denotes the bitwise AND operation. Now you must process q queries of the form u v. For each query, find the minimum possible length of a walk from u to v . The MEX (minimum excluded) of a set is the smallest non-negative integer that does not belong to the set. For instance: The first line contains two integers n and m ( 2 <= q n <= q 10^5 ; n-1 <= q m <= q min{ <= ft( frac{n(n-1)}{2},10^5 right)} ). Each of the next m lines contains three integers a , b , and w ( 1 <= q a, b <= q n , a neq b ; 0 <= q w < 2^{30} ) indicating an undirected edge between vertex a and vertex b with weight w . The input will not contain self-loops or duplicate edges, and the provided graph will be connected. The next line contains a single integer q ( 1 <= q q <= q 10^5 ). Each of the next q lines contains two integers u and v ( 1 <= q u, v <= q n , u neq v ), the description of each query. For each query, print one line containing a single integer -- the answer '...