Tree Swapping (Easy)

**This is the easy version of the problem. Here, the sum of $N$ is $\le 5000$.** You are given a tree with $N$ nodes labelled $1$ through $N$. For a given pair of binary strings $S$ and $T$, we define $f(S, T)$ as follows: - In one operation, you can swap $S_u$ and $S_v$ if $(u, v)$ are adjacent in the tree. - $f(S, T)$ is defined as the minimum swaps necessary to make $S = T$. - In case it is