#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

vector<int> E[200001];
int K[200001];
int dfs(int p, int mae) {
	int tmp = 1;
	for (int to : E[p]) {
		if (to != mae) {
			tmp += dfs(to, p);
		}
	}
	return K[p] = tmp;
}


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;
	rep(i, N - 1) {
		int u, v;
		cin >> u >> v;
		E[u].pb(v);
		E[v].pb(u);
	}

	dfs(1, 0);
	rep1(i, N) {
		ll kotae = (ll)K[i] * K[i];
		for (int to : E[i]) {
			if (K[to] < K[i]) {
				kotae -= (ll)K[to] * K[to];
			}
		}
		co(kotae);
	}



	Would you please return 0;
}