import sys
sys.setrecursionlimit(100050)
N = int(input())
AB = [list(map(int,input().split())) for _ in range(N-1)]
E = [[] for _ in range(N)]
P1 = [0] * N

for a, b in AB:
    a -= 1
    b -= 1
    E[a].append(b)
    E[b].append(a)

def dfs(x,p= -1):
    ret = 0
    for y in E[x]:
        if y != p:
            ret += dfs(y,x)
            if y < x:
                ret += 1
    P1[x] = ret
    return ret

dfs(0)
P2 = [0] * N
P2[0] = P1[0]
Q = [0]
Q2 = []
nv = [1] * N
nv[0] = 1
while Q:
    while Q:
        x = Q.pop()
        for y in E[x]:
            if nv[y]:
                nv[y] = 0
                Q2.append(y)
                P2[y] = P2[x]
                if x < y:
                    P2[y] += 1
                else:
                    P2[y] -= 1
    Q,Q2 = Q2,Q

for p in P2:
    print(p)