#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, head[200005], to[400005], nxt[400005], ccnt, son[200005], d[200005], siz[200005], f[200005], sson[200005];
inline void add(int p, int q) {
	nxt[++ccnt] = head[p];
	to[ccnt] = q;
	head[p] = ccnt;
}
inline void dfs(int p, int q) {
	siz[p] = 1;
	for (int i = head[p]; i; i = nxt[i]) {
		if (to[i] == q) continue;
		dfs(to[i], p);
		siz[p] += siz[to[i]];
		if (siz[to[i]] > siz[son[p]]) {
			sson[p] = son[p];
			son[p] = to[i];
		} else if (siz[to[i]] > siz[sson[p]]) {
			sson[p] = to[i];
		}
	}
	for (int i = head[p]; i; i = nxt[i]) {
		if (to[i] == q) continue;
		d[p] += d[to[i]];
		if (son[p] != to[i]) {
			d[p] += siz[to[i]] * (n - siz[to[i]]);
		}
	}
}
inline void ddfs(int p, int q) {
	if (p == 1) {
		f[p] = d[p];
	} else {
		f[p] = d[p] + siz[son[p]] * (n - siz[son[p]]);
		if (son[q] == p && siz[p] >= n - siz[q]) {
			f[p] += f[q] - d[p] + siz[p] * (n - siz[p]);
			if (siz[sson[q]] >= n - siz[q]) {
				f[p] -= siz[sson[q]] * (n - siz[sson[q]]);
			} else {
				f[p] -= (n - siz[q]) * siz[q];
			}
		} else {
			f[p] += f[q] - d[p];
		}
		if (siz[son[p]] >= n - siz[p]) {
			f[p] -= siz[son[p]] * (n - siz[son[p]]);
		} else {
			f[p] -= (n - siz[p]) * siz[p];
		}
	}
	for (int i = head[p]; i; i = nxt[i]) {
		if (to[i] != q) ddfs(to[i], p);
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	int p, q;
	for (int i = 1; i < n; i++) {
		cin >> p >> q;
		add(p, q);
		add(q, p);
	}
	dfs(1, 0);
	ddfs(1, 0);
	for (int i = 1; i <= n; i++) {
		cout << f[i] << "\n";
	}
}