unlimited many years of battling, they at long last became partners to set up a Codeforces round. To praise this lucky occasion, they chose to make a dedication chart on n vertices. They add an edge between vertices u and v in the remembrance diagram if both of the accompanying conditions hold:
Correct answer will be upvoted else downvoted.
After unlimited many years of battling, they at long last became partners to set up a Codeforces round. To praise this lucky occasion, they chose to make a dedication chart on n vertices.
They add an edge between vertices u and v in the remembrance diagram if both of the accompanying conditions hold:
One of u or v is the precursor of the other in Soroush's tree.
Neither of u or v is the progenitor of the other in Keshi's tree.
Here vertex u is viewed as precursor of vertex v, if u lies on the way from 1 (the root) to the v.
Jumping all of a sudden, Mashtali attempted to track down the greatest inner circle in the remembrance chart for reasons unknown. He fizzled in light of the fact that the chart was too huge.
Help Mashtali by discovering the size of the most extreme club in the commemoration chart.
As an update, inner circle is a subset of vertices of the diagram, every two of which are associated by an edge.
Input :The primary line contains an integer t (1≤t≤3⋅105) — the number of experiments. The portrayal of the experiments follows.The primary line of each experiment contains an integer n (2≤n≤3⋅105).
The second line of each experiment contains n−1 integers a2,… ,an (1≤
The third line of each experiment contains n−1 integers b2,… ,bn (1≤bi<i), bi being the parent of the vertex I in Keshi's tree.
It is ensured that the given diagrams are trees. It is ensured that the amount of n over all experiments doesn't surpass 3⋅105.
Output :For each experiment print a solitary integer — the size of the most extreme coterie in the dedication chart.
Step by step
Solved in 3 steps with 1 images
