N = int(input())
Edge = [[] for _ in range(N)]
for i in range(N-1):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    Edge[u].append(v)
    Edge[v].append(u)
ans = [0]*N
# ある頂点vに隣接している頂点同士は+=1となる
for i in range(N):
    v = i
    kouho = Edge[i]
    for j in kouho:
        ans[j] += len(kouho)-1
print(*ans, sep="\n")