import pypyjit
pypyjit.set_param("max_unroll_recursion=-1")
import sys
sys.setrecursionlimit(10**7)
N = int(input())
edge = [[] for _ in range(N)]
for _ in range(N-1):
    u,v = list(map(int,input().split()))
    u -= 1;v -= 1
    edge[u].append(v)
    edge[v].append(u)

ans = [-1] * N
def dfs(n,pre):
    SUM = 1
    child = []
    for i in edge[n]:
        if(i == pre):continue
        c = dfs(i,n)
        SUM += c
        child.append(c)
    
    v = SUM * SUM
    for i in child:v -= i * i
    ans[n] = v

    return SUM

dfs(0,-1)
for i in ans:
    print(i)