Playing with Numbers

You are given a rooted tree with $N$ nodes (numbered $1$ through $N$); node $1$ is the root. For each valid $i$, the $i$-th node has a value $v_i$ and another parameter $m_i$. A leaf is a node without sons. Let's denote the number of leaf nodes in the tree by $L$ and their numbers by $l_1, l_2, \ldots, l_L$, in increasing order. Then, for each valid $i$, let's define the *answer* for the leaf $l_