import sys
def input():
	return sys.stdin.buffer.readline()[:-1]

n = int(input())
adj = [[] for _ in range(n)]
chl = [0 for _ in range(n)]
ans = [0 for _ in range(n)]

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


visited = [False for _ in range(n)]
stack = [(0, -1)]
while stack:
	i, p = stack[-1]
	if not visited[i]:
		visited[i] = True
		for j in adj[i]:
			if j == p:
				continue
			stack.append((j, i))
	else:
		stack.pop()
		for j in adj[i]:
			if j == p:
				continue
			ans[i] += chl[j] * chl[i] * 2
			chl[i] += chl[j]
		ans[i] += 2 * chl[i] + 1
		chl[i] += 1

print(*ans, sep="\n")