You are given a rooted tree
consisting of n nodes. The nodes are numbered 1,2,…,n, and node 1 is the root.
Each node has a value.
Your task is to process following
types of queries:
1. change the value of node s to x
2. calculate the sum of values in
the subtree of node s
Constraints
$1\le n, q \le 2 \cdot 10^5$
$1≤a,b,s≤n$
$1≤a,b,s≤n$
$1≤v_i,x≤10^9$