Red Blue Decomposition

You have a tree with $N$ vertices rooted at vertex $1$. Color each vertex of the tree either red or blue such that the expression $$ |c_R - c_B| + |s_R - s_B| $$ is minimized, where: - $c_R$ is the number of vertices colored red, and $c_B$ is the number of vertices colored blue. - $s_R$ is the *score* of the color red, and $s_B$ is the score of the color blue. These can be computed as follows: