Score : 400 points
Given is a rooted tree with N vertices numbered 1 to N. The root is Vertex 1, and the i-th edge (1 \leq i \leq N - 1) connects Vertex a_i and b_i.
Each of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.
Now, the following Q operations will be performed:
Find the value of the counter on each vertex after all operations.
Input is given from Standard Input in the following format:
N Q a_1 b_1 : a_{N-1} b_{N-1} p_1 x_1 : p_Q x_Q
Print the values of the counters on Vertex 1, 2, \ldots, N after all operations, in this order, with spaces in between.
4 3 1 2 2 3 2 4 2 10 1 100 3 1
100 110 111 110
The tree in this input is as follows:
Each operation changes the values of the counters on the vertices as follows:
6 2 1 2 1 3 2 4 3 6 2 5 1 10 1 10
20 20 20 20 20 20