import sys input = sys.stdin.readline from collections import deque sys.setrecursionlimit(10**6) class Tree: def __init__(self, N): self.V = N self.edge = [[] for _ in range(N)] self.order = [] def add_edges(self, ind=1, bi=True): for i in range(self.V-1): a,b = map(int, input().split()) a -= ind; b -= ind self.edge[a].append(b) if bi: self.edge[b].append(a) def dp(self, start): stack = deque([start]) self.parent = [self.V]*self.V; self.parent[start] = -1 self.order.append(start) #記録したい値の配列を定義 self.dp_for = [0]*self.V self.dp_back = [0]*self.V while stack: v = stack.pop() for u in self.edge[v]: if u==self.parent[v]: continue self.parent[u]=v stack.append(u); self.order.append(u) self.dp_for[u] += self.dp_for[v] if u > v: self.dp_for[u] += 1 for v in self.order[::-1]: for u in self.edge[v]: if u==self.parent[v]: continue self.dp_back[v] += self.dp_back[u] #帰りがけ処理 if u < v: self.dp_back[v] += 1 N = int(input()) G = Tree(N) G.add_edges(ind=1, bi=True) ans=[0]*N G.dp(0) for i in range(N): ans[i]=G.dp_back[0]+G.dp_for[i] print(*ans, sep='\n')