from collections import deque
N = int(input())
E = [[] for _ in range(N)]
for _ in range(N-1):
    u,v = map(int, input().split())
    E[u-1].append(v-1)
    E[v-1].append(u-1)

parent = [-1]*N
used = [-1]*N
q = deque()
q.append(0)
used[0] = 0
while q:
    u = q.popleft()
    for v in E[u]:
        if used[v] >= 0:
            continue
        q.append(v)
        parent[v] = u
        used[v] = used[u]+1

num = [0]*N
for i in range(N):
    used[i] = (used[i], i)

used.sort(reverse=True)
for u in used:
    if u[1] == 0:
        continue
    num[parent[u[1]]] += num[u[1]]+1

for i in range(N):
    ans = 2*num[i]+1
    cnt = 0
    for v in E[i]:
        if parent[i] == v:
            continue
        cnt += 1
    ans += cnt*(cnt-1)
    for v in E[i]:
        if parent[i] == v:
            continue
        ans += 2*num[v]*(cnt-1)
    print(ans)