# distance 2であれば次数degreeから計算可能

N = int(input())
degree = [0]*(N+1)
edges = [[] for i in range(N+1)]
for i in range(N-1):
    u, v = map(int, input().split())
    degree[u] += 1
    degree[v] += 1
    edges[u].append(v)
    edges[v].append(u)
    
for i in range(1, N+1):
    ans = 0
    for nxt in edges[i]:
        ans += degree[nxt]-1
    print(ans)