It is a tree

*This problem has subtasks.* You are given a tree$^\dagger$ with $N$ vertices, **rooted at vertex $1$**. Each vertex of this tree will have either $0$ people, or $1$ person standing on it. Consider the following process on this tree: - Let $\text{score}_u$ denote the score of vertex $u$. Initially, this is $0$ for all vertices. - Every second, each person in the tree will *simultaneously* move o