Color Score

You are given a tree with $N$ nodes rooted at node $1$. Each node $i$ has an associated color $C_i$ and a value $V_i$. For any tree with **at least two** nodes, the **score** for a partition (obtained by removing a **single leaf** — that is, a node with degree $1$) is defined as the sum, over all colors, of the absolute differences between the total values of nodes with that color in the two resu