B"You are given a tree consisting of n vertices. Some of the vertices (at least two) are black, all the other vertices are white. You place a chip on one of the vertices of the tree, and then perform the following operations: You are not allowed to choose the same black vertex y in two operations in a row (i. xe2 x80 x89e., for every two consecutive operations, the chosen black vertex should be different). You end your operations when the chip moves to the black vertex (if it is initially placed in a black vertex, you don't perform the operations at all), or when the number of performed operations exceeds 100^{500} . For every vertex i , you have to determine if there exists a (possibly empty) sequence of operations that moves the chip to some black vertex, if the chip is initially placed on the vertex i . The first line contains one integer n ( 3 <= n <= 3 cdot 10^5 ) -- the number of vertices in the tree. The second line contains n integers c_1, c_2, ... , c_n ( 0 <= c_i <= 1 ), where c_i = 0 means that the i -th vertex is white, and c_i = 1 means that the i -th vertex is black. At least two values of c_i are equal to 1 . Then n-1 lines follow, each of them contains two integers u_i and v_i ( 1 <= u_i, v_i <= n ; u_i ne v_i ) -- the endpoints of some edge. These edges form a tree. Print n integers. The i -th integer should be equal to 1 if there exists a (possibly empty) sequence of operations that moves the chip to some black vertex if it is placed on the vertex i , and 0 if no such sequence of operations exists. "...