from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 6)

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, par):
    ans[v] += 1

    cs = []
    for to in adj[v]:
        if to == par: continue
        cs.append(dfs(to, v))

    for i in range(len(cs)):
        # v と子 i
        ans[v] += cs[i] * 2
        # 子 i と子 j
        for j in range(i+1, len(cs)):
            ans[v] += cs[i] * cs[j] * 2

    return sum(cs) + 1


ans = [0] * N
dfs(0, -1)
print(*ans, sep='\n')