Not Equal On Tree

You are given a tree of $N$ nodes, and $2$ arrays of size $N$ - $A$ and $B$. You would like to ensure that $A_i \neq B_i$ for *every* $1 \leq i \leq N$. To achieve this, you can perform the following operation **exactly once**: 1. Pick a subset $S = \{X_1, X_2, \ldots, X_{|S|}\}$ of the nodes, such that the subgraph induced by $S$ is **connected**. - In other words, if $x, y \in S$, then eve