Greater Colours

Given a graph $G$ which is a tree containing $n$ nodes. Each node is numbered from $1$ to $n$ and given a colour from $1$ to $C$. The given tree is rooted at the node number $1$. Each of the nodes in $G$ has an associated value $a_i$ and an associated colour $c_i$. You will be given $q$ queries of the form "$(v, k)$", where $v$ is denotes the vertex and $k$ is a number. For each query of the given