These are the signs of Tree DP problems:
Definitely, when we have tree structure. Vertices are connected without cycles.
Aggregate computation. Answers depend on combining subtree results.
Path or subtree properties. Maximum path, counting configurations, distance sums.
The state is typically representing the answer for the subtree rooted at . For re-rooting problems, you'll have when is the root.
