Another Tree with Number Theory

You are given a rooted tree with $N$ nodes (numbered $1$ through $N$; node $1$ is the root). For each $i$ ($1 \le i \le N-1$), the parent of the node $i+1$ is $p_i$. You need to answer $Q$ queries. (Sounds quite familiar!) For each query, first, $W$ tasks are given to node $V$. These tasks are processed in the tree in the following way: - When a node receives $a$ tasks and it has no children,