Tree Cut Xor

You are given a tree with $N$ vertices. Initialize a variable $X = 0$. You would like to perform the following operation $N-1$ times: * Choose an edge $(u,v)$ that still hasn't been deleted. * Delete the edge $(u,v)$. * Let $\text{siz}(u)$ denote the size of the connected component that $u$ is contained in and $\text{siz}(v)$ denote the size of the connected component that $v$ is contained in. XO