Good Paths On Tree

You are given a weighted tree. A simple path on the tree between vertices $u$ and $v$ is defined as good if the xor sum of all the edge weights in path is 0. See example for further details. You have to perform two types of queries on it : a) $1$ $x$ : You will be given a node $x$. and you have to find the number of good paths starting at node $x$, and ending at any of the node in the tree. b