import sys
input = sys.stdin.readline
from collections import deque
class Tree:
  def __init__(self, N):
    self.V = N
    self.edge = [[] for _ in range(N)]
  
  def add_edges(self, ind=1, bi=True):
    for i in range(self.V-1):
      a,b = map(int, input().split())
      a -= ind; b -= ind
      self.edge[a].append(b)
      if bi: self.edge[b].append(a)

  def add_edge(self, a, b, bi=True):
    self.edge[a].append(b)
    if bi: self.edge[b].append(a)

  def dfs(self, start):
    stack = deque([start])
    self.parent = [N]*N; self.parent[start] = -1
    order = [start]
    part_num = [1]*N
    ans = [0]*N
    cnt = 0
    #記録したい値の配列を定義
    while stack:
      v = stack.pop()
      for u in self.edge[v]:
        if u==self.parent[v]:continue
        self.parent[u]=v
        stack.append(u); order.append(u)
    for v in order[::-1]:
      for u in self.edge[v]:
        if u==self.parent[v]:continue
        #　帰りがけ処理
        ans[v] -= part_num[u]**2
        part_num[v] += part_num[u]
      ans[v] += part_num[v]**2
    return ans
  
N = int(input())
G = Tree(N)
G.add_edges(ind=1, bi=True)
print(*G.dfs(0), sep='\n')