#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;




signed main(){
	int N;
	cin >> N;
	vector<vector<int>>g(N);
	REP(i,N - 1){
		int a,b;
		cin >> a >> b;
		--a;--b;
		g[a].emplace_back(b);
		g[b].emplace_back(a);
	}
	vector<int>ans(N);
	vector<int>sz(N);
	auto dfs = [&](auto&&f,int now,int par) -> int {
		int ret = 1;
		int mul = 1;
		int sum = 1;
		for(auto e:g[now]){
			if(e == par)continue;
			sum += f(f,e,now);
		}
		for(auto e:g[now]){
			if(e == par)continue;
			int t = sz[e];
			ret += t;
			sum -= t;
			mul += t * sum * 2;
		}
		ans[now] = mul;
		return sz[now] = ret;
	};
	dfs(dfs,0,-1);
	for(auto &e:ans)cout << e << endl;
}