#include <bits/stdc++.h>

using namespace std;

long long int dp[200005];
vector <int> adj[200005];
long long int cnt[200005];

long long int func(int now, int prev)
{
	cnt[now] = 1;
	for (auto next : adj[now])
	{
		if (next == prev) continue;
		cnt[now] += func(next, now);
	}
	return cnt[now];
}

void solve(int now, int prev)
{
	//cout << now << ' ' << cnt[now] << '\n';
	dp[now] = cnt[now] * cnt[now];
	for (auto next : adj[now])
	{
		if (next == prev) continue;
		solve(next, now);
		dp[now] -= (cnt[next] * cnt[next]);
	}
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n, a, b;

	cin >> n;

	for (int i = 0; i < n - 1; i++)
	{
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	
	func(1, 0);
	solve(1, 0);

	for (int i = 1; i <= n; i++)
	{
		cout << dp[i] << '\n';
	}

	return 0;
}