Greetings everyone, I have a question regarding certain tree DP problems — for example, this one: https://cses.fi/problemset/task/1130. Why is it that we can arbitrarily choose node 1 as the root (rather than some other node $$$u$$$ without it affecting the final outcome?




