#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 4611686018427387903;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

VVI edge(214514, VI(0));
VI ans(214514,0);

ll dfs(int v, int p){
	ll sum=0;
	VI a(0);
	for (auto to:edge[v]) {
		if (to!=p){
			ll k=dfs(to,v);
			sum+=k;
			a.push_back(k);
		}
	}
	ans[v]+=sum*2;
	for(auto x:a)
		ans[v]+=(sum-x)*x;
	ans[v]++;
	return sum+1;
}

int main(){
	int n; cin >> n;
	int a, b;
	REP(i,n-1){
		cin >> a >> b;
		a--; b--;
		edge[a].push_back(b);
		edge[b].push_back(a);
	}
	dfs(0,-1);
	REP(i,n)
		cout << ans[i] << endl;
	return 0;
}