N=int(input())
graph=[[] for _ in range(N+1)]
for _ in range(N-1):
	u,v=map(int,input().split())
	graph[u].append(v)
	graph[v].append(u)

dist=[0]*(N+1)
par=[-1]*(N+1)
task=[1]
for v in task:
	for u in graph[v]:
		if u==par[v]: continue
		par[u]=v
		task.append(u)
		dist[u]=dist[v]+1

ans=[0]*(N+1)
for i in range(1,N+1):
	for v in graph[i]:
		ans[i]+=len(graph[v])-1

print(*ans[1:],sep='\n')