B'You are given a tree of n nodes. The tree is rooted at node 1 , which is not considered as a leaf regardless of its degree. Each leaf of the tree has one of the two colors: red or blue. Leaf node v initially has color s_{v} . The color of each of the internal nodes (including the root) is determined as follows. Integer k is a parameter that is same for all the nodes. You need to handle the following types of queries: The first line of the input consists of two integers n and k ( 2 <= n <= 10^{5} , -n <= k <= n ) -- the number of nodes and the initial parameter k . Each of the next n - 1 lines contains two integers u and v ( 1 <= u,v <= n ), denoting that there is an edge between vertices u and v . The next line consists of n space separated integers -- the initial array s ( -1 <= s_i <= 1 ). s_{i} = 0 means that the color of node i is red. s_{i} = 1 means that the color of node i is blue. s_{i} = -1 means that the node i is not a leaf. The next line contains an integer q ( 1 <= q <= 10^5 ), the number of queries. q lines follow, each containing a query in one of the following queries: For each query of the first type, print 0 if the color of vertex v is red, and 1 otherwise. (i) The initial tree (ii) The tree after the 3rd query (iii) The tree after the 7th query '...