Nuttela loves trees !

Nuttela is stuck with a tree problem and wants you to solve this. Given a tree with $N$ nodes , $N-1$ edges and value $A$$i$ of every node. as either being a $0$ or a $1$ Do the following operations: - find the total number of set nodes below the $M$th, where the $M$th node lies in the path between the root node $1$ and $U$th node - swap the value of a particular node ( $0$ $→$ $1$ and vice ve