Rooted Trees

You are given a rooted tree having nodes N . Every node have value equal to zero initially , Let's call it version 1. You will be given Q queries of two type:- $1$ $ver1$ $ver2$ $v$ $c$ You have to make version $ver2$ from version $ver1$ by adding value $c$ in subtree of vertex $v$ at alternate levels , starting from level of vertex $v$. $2$ $ver1$ $v$ You have to tell value of vertex $v$ in