import sys
from collections import deque

input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 9)

N = int(input())
T = [[] for _ in range(N)]
edges = [tuple(int(x) - 1 for x in input().split()) for _ in range(N - 1)]

for i, (a, b) in enumerate(edges):
    T[a].append((b, i))
    T[b].append((a, i))

d = deque([(0, -1)])
rev_edges = [None] * (N - 1)
while d:
    v, p = d.pop()
    for x, i in T[v]:
        if x == p:
            continue
        rev_edges[i] = (v > x)
        d.append((x, v))

ans = [0] * N
cur = rev_edges.count(True)


def rec(v, p):
    global cur
    ans[v] = cur
    for x, i in T[v]:
        if x == p:
            continue
        cur += -1 if rev_edges[i] else 1
        rev_edges[i] = not rev_edges[i]
        rec(x, v)
        cur += -1 if rev_edges[i] else 1
        rev_edges[i] = not rev_edges[i]


rec(0, -1)
print(*ans, sep='\n')