import sys
input = sys.stdin.readline

N=int(input())
E=[[] for i in range(N)]

for i in range(N-1):
    x,y=map(int,input().split())
    x-=1
    y-=1
    E[x].append(y)
    E[y].append(x)
    
ROOT=0

QUE=[ROOT] 
Parent=[-1]*N
Parent[ROOT]=N # ROOTの親を定めておく.
TOP_SORT=[] # トポロジカルソート

Child=[[] for i in range(N)]

while QUE: # トポロジカルソートと同時に親を見つける
    x=QUE.pop()
    TOP_SORT.append(x)
    for to in E[x]:
        if Parent[to]==-1:
            Parent[to]=x
            Child[x].append(to)
            QUE.append(to)

ANS=0
SUMS=[0]*N

for x in TOP_SORT[1:][::-1]:
    y=Parent[x]
    if x>y:
        SUMS[x]+=1
    else:
        ANS+=1
        SUMS[x]-=1

for x in TOP_SORT[1:][::-1]:
    y=Parent[x]

    SUMS[x]+=SUMS[y]

for i in range(N):
    print(ANS+SUMS[i])