N = int(input())

tree = [set() for _ in range(N)]

for i in range(N-1):
    a, b = map(lambda x: int(x) - 1, input().split())
    tree[a].add(b)
    tree[b].add(a)

for i in range(N):
    sum = 0
    for next in tree[i]:
        sum += len(tree[next]) - 1
    print(sum)