from collections import defaultdict

N = int(input())
adj = defaultdict(list)
for _ in range(N-1):
    u, v = map(lambda x: int(x)-1, input().split())
    adj[u].append(v)
    adj[v].append(u)


def dfs(v, prev, depth):
    if depth == 2: return 1
    res = 0
    for to in adj[v]:
        if to == prev: continue
        res += dfs(to, v, depth+1)
    return res


ans = []
for i in range(N):
    ans.append(dfs(i, -1, 0))

print(*ans, sep='\n')