Alice and Bob are playing a game. They have a tree comprising of n vertices. At first, Bob has k chips, the I-th chip is situated in the vertex computer based intelligence (every one of these vertices are extraordinary). Prior to the game beginnings, Alice will put a chip into one of the vertices of the tree.
Correct answer will be upvoted else Multiple Downvoted. Computer science.
Alice and Bob are playing a game. They have a tree comprising of n vertices. At first, Bob has k chips, the I-th chip is situated in the vertex computer based intelligence (every one of these vertices are extraordinary). Prior to the game beginnings, Alice will put a chip into one of the vertices of the tree.
The game comprises of turns. Each turn, the accompanying occasions occur (consecutively, precisely in the accompanying request):
Alice either moves her chip to a neighboring vertex or doesn't move it;
for each Bob's chip, he either moves it to a neighboring vertex or doesn't move it. Note that this decision is done freely for each chip.
The game closures when Alice's chip has a similar vertex with one (or numerous) of Bob's chips. Note that Bob's chips might have a similar vertex, despite the fact that they are in various vertices toward the start of the game.
Alice needs to augment the number of turns, Bob needs to limit it. If the game finishes in some turn (Alice moves her chip to a vertex that contains one or numerous Bob's chips), this turn is counted.
For every vertex, compute the number of turns the game will endure if Alice puts her chip in that vertex.
Input
The main line contains one integer n (2≤n≤2⋅105) — the number of vertices in the tree.
Then, at that point, n−1 lines follow, each line contains two integers ui, vi (1≤ui,vi≤n; ui≠vi) that signify the endpoints of an edge. These edges structure a tree.
The following line contains one integer k (1≤k≤n−1) — the number of Bob's chips.
The last line contains k integers a1, a2, ..., ak (1≤
Output
Print n integers. The I-th of them ought to be equivalent to the number of turns the game will endure assuming Alice at first places her chip in the vertex I. In the event that one of Bob's chips is as of now positioned in vertex I, the response for vertex I is 0.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images
