The first line contains a number *n* denoted how many nodes in the tree(1 ≤ *n* ≤ 10^{5}). The next *n* - 1 lines, each line has two numbers (*u*, *v*) describe a edge of the tree(1 ≤ *u*, *v* ≤ *n*).

The next 2 lines, each line contains *n* number, the first line is the initial color of each node(0 or 1), and the second line is the initial weight, let's say *W*_{i}, of each node(|*W*_{i}| ≤ 10^{9}).

The next line contains a number *m* denoted how many operations we are going to process(1 ≤ *m* ≤ 10^{5}). The next *m* lines, each line describe a operation (*t*, *u*) as we mentioned above(0 ≤ *t* ≤ 2, 1 ≤ *u* ≤ *n*, |*w*| ≤ 10^{9}).