There is an undirected tree with n nodes labeled from $0$ to n $- 1$ and n $- 1$ edges.

You are given an integer n and a $2$D integer array edges of length n $- 1$, where edges[i] $= [a_i, b_i]$ indicates an edge between nodes $a_i$ and $b_i$ in the tree. You are also given an integer array restricted representing restricted nodes.

Return the maximum number of nodes you can reach from node $0$ without visiting any node in restricted.

Note: Node $0$ is guaranteed not to be a restricted node.

Constraints:

• $2 \leq$ n $\leq 10^5$

• edges.length $==$ n $- 1$

• edges[i].length $== 2$

• $0 \leq a_i, b_i <$ n

• $a_i \neq b_i$

• edges represents a valid tree.

• $1 \leq$ restricted.length $<$ n

• $1 \leq$ restricted[i] $<$ n

• All the values of restricted are unique.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.