Subtree Coloring

You have a tree with $N$ nodes rooted at node $1$. You want to color each node of the tree either red or blue. A coloring of the tree is considered to be *good* if for **every** subtree, the absolute difference between the number of red and blue nodes in that subtree is at most $1$. Find the number of good colorings of the tree. The count can be large, so print it modulo $10^9+7$. ### Input -