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 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* ≤ 1, 1 ≤ *u* ≤ *n*).