Parity tree

You are given a tree consisting of n nodes numbered from 1 to n. The weights of edges of the tree can be any binary integer satisfying following Q conditions. - Each condition is of form u, v, x where u, v are nodes of the tree and x is a binary number. For satisfying this condition, sum of the weight of all the edges present in the path from node u to v of the tree, should have even if x = 0, od