import sys
sys.setrecursionlimit(10 ** 9)

n = int(input())
edges = [[] for _ in range(n)]
for _ in range(n - 1):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    edges[u].append(v)
    edges[v].append(u)

size = [1] * n
ans = [0] * n
def dfs(pos, bpos):
    for npos in edges[pos]:
        if npos == bpos:
            continue
        dfs(npos, pos)
        size[pos] += size[npos]
        ans[pos] -= size[npos] * size[npos]
    ans[pos] += size[pos] * size[pos]

dfs(0, -1)
print(*ans, sep="\n")