Tree Queries

You are given an undirected weighted tree of $N$ nodes, numbered from $1$ to $N$. The cost of a path is defined as the **bitwise AND** of the weights of the edges on that path. The cost of the path having only one node is, by default, $0$. You are given $Q$ queries. In each query, you will be given a node $x$. For each query, your task is to find two nodes $u$ and $v$, such that - The node $x$ l