[USACO18JAN] Cow at Large P

贝茜在一棵有 $n$ 个节点的树上，每个度为 $1$ 的结点是出入口。开始时，每个出入口都可能有一个农民。每个时刻，贝茜和农民都可以移动到相邻的一个结点。如果在她到达一个出口前，农民与贝茜相遇了（在边上或点上均算），则贝茜将被抓住。过程中，农民们与贝茜均知道对方在哪个结点。 请问：对于每个结点 $i$，如果开始时贝茜在该结点，最少有多少农民，她才会被抓住。 #### 输入 第一行包含 $N$ 。 在接下来的 $N-1$ 行中，每行有两个在 $1\sim N$ 范围内的整数，表示一条边。 #### 输出 输出 $N$ 行，第 $i$ 行表示如果开始时贝茜在结点 $i$ ，最少有多少农民，她才会被抓住。 Translated by @Planet6174

Cornered at last, Bessie has gone to ground in a remote farm. The farm consists of $N$ barns ($2 \leq N \leq 7 \cdot 10^4$) and $N-1$ bidirectional tunnels between barns, so that there is a unique path between every pair of barns. Every barn which has only one tunnel is an exit. When morning comes, Bessie will surface at some barn and attempt to reach an exit. But the moment Bessie surfaces at some barn, the law will be able to pinpoint her location. Some farmers will then start at various exit barns, and attempt to catch Bessie. The farmers move at the same speed as Bessie (so in each time step, each farmer can move from one barn to an adjacent barn). The farmers know where Bessie is at all times, and Bessie knows where the farmers are at all times. The farmers catch Bessie if at any instant a farmer is in the same barn as Bessie, or crossing the same tunnel as Bessie. Conversely, Bessie escapes if she reaches an exit barn strictly before any farmers catch her. Bessie is unsure at which barn she should surface. For each of the $N$ barns, help Bessie determine the minimum number of farmers who would be needed to catch Bessie if she surfaced there, assuming that the farmers distribute themselves optimally among the exit barns. Note that the time limit for this problem is slightly larger than the default: 4 seconds for C/C++/Pascal, and 8 seconds for Java/Python.

The first line of the input contains $N$. Each of the following $N-1$ lines specify two integers, each in the range $1 \ldots N$, describing a tunnel between two barns.

Please output $N$ lines, where the $i$th line of output tells the minimum number of farmers necessary to catch Bessie if she surfaced at the $i$th barn.

7
1 2
1 3
3 4
3 5
4 6
5 7

3
1
3
3
3
1
1