title: for a given path between node u-v in tree find maximum XOR with any node in that path
body: <p>For a Given a tree, there are certain <code>1&lt;=q&lt;=10^5</code> queries. Each query has nodes <code>u</code>, <code>v</code> and <code>K</code>. How to find <code>max(K</code>XOR<code>node)</code> where <code>node</code> is any node lying in the path between node u and v. Where XOR is bitwise <code>XOR</code> operation. </p>
  
  <p>Any help, what will be an optimal way of performing the queries for a number of times. </p>