import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class Graph(object):
	def __init__(self):
		self.graph = defaultdict(list)

	def __len__(self):
		return len(self.graph)

	def add_edge(self, a, b):
		self.graph[a].append(b)

def DFS(G, W, Wlist, visit, node):
	for i in G.graph[node]:
		if visit[i] != 1:
			visit[i] = 1
			DFS(G, W, Wlist, visit, i)
			W[node] += W[i]
			Wlist[node].append(W[i])


#処理内容
def main():
	N = int(input())
	G = Graph()
	for i in range(N - 1):
		a, b = getlist()
		a -= 1; b -= 1
		G.add_edge(a, b)
		G.add_edge(b, a)

	W = [1] * N
	Wlist =[[] for i in range(N)]
	# print(len(Wlist))
	Wans = [0] * N
	visit = [0] * N
	visit[0] = 1
	DFS(G, W, Wlist, visit, 0)
	# print(Wlist)
	for i in range(N):
		if Wlist[i] == []:
			Wans[i] = 1
		else:
			Wans[i] = (W[i] - 1) * (W[i] - 2) + 2 * (W[i] - 1) + 1
			for j in Wlist[i]:
				Wans[i] -= j * (j - 1)
		# else:
		# 	Wans[i] = 2 * ((W[i] - 1) ** 2) + 2 * (W[i] - 1) + 1
		# 	for j in Wlist[i]:
		# 		Wans[i] -= 2 * (j ** 2)

	for i in range(N):
		print(Wans[i])
	




if __name__ == '__main__':
	main()