Binod and Query

A tree can be defined as an undirected acyclic graph, with nodes numbered from $1$ to $N$. In this problem, the tree is always rooted at $1$. The Node $i$ has a value $V_{i}$. Binod has $Q$ queries, each query has two number $X$ and $Y$. For each query, you need to start from the Node $X$ and jump up the tree by $Y$ levels collecting values at each node visited until there are not $Y$ levels r