import sys
sys.setrecursionlimit(3*10**5)

n = int(input())
e = [[] for i in range(n)]
for i in range(n-1):
    a,b = [int(x)-1 for x in input().split()]
    e[a].append(b)
    e[b].append(a)


def dfs(x,p):
    count = 0
    for nex in e[x]:
        if nex == p:
            continue
        if nex < x:
            count += 1
        count += dfs(nex,x)

    return count

ans = [0]*n
ans[0] = dfs(0,-1)

def dfs2(x,p):
    if x != 0:
        if p > x:
            ans[x] = ans[p]-1
        else:
            ans[x] = ans[p]+1

    for nex in e[x]:
        if nex == p:
            continue
        dfs2 (nex,x)
dfs2(0,-1)
for i in ans:
    print(i)