Graph Sum

Given a Tree T where each vertex v has a weight w, you need to support the following queries:- 0 v m Add the number m, K times to the vertex v . Here K denotes the last 5 digits of L where L is the number of ways you can make m by using the numbers 2 and 4. Eg. for a query 0 1 6, you need to add 6, 3 times to the vertex 1. Which means you will add 18 to the weight of vertex 1. This is because 6 =