N = int(input())
to = [[] for _ in range(N)]

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

p = [-2] * N
stack = [0]
p[0] = -1
while stack:
    v = stack.pop()
    for u in to[v]:
        if p[u] == -2:
            p[u] = v
            stack.append(u)

n_child = [0] * N
for i in range(N):
    n_child[i] = len(to[i]) - int(i != 0)

for i in range(N):
    res = 0
    for j in to[i]:
        if j == p[i]:
            res += n_child[j] - 1
            if p[j] != -1:
                res += 1
        else:
            res += n_child[j]
    print(res)