#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int n;
vector<vector<int>> g;
vector<ll> sz;
vector<ll> res;
void dfs_sz(int cur, int pre) {
	sz[cur] = 1;
	for (auto nxt : g[cur]) {
		if (pre == nxt) continue;
		dfs_sz(nxt, cur);
		sz[cur] += sz[nxt];
	}
}

void dfs(int cur, int pre) {
	ll all = 0;
	for (auto nxt : g[cur]) {
		if (nxt == pre) continue;
		all += sz[nxt];
	}
	res[cur] += (sz[cur] - 1) * 2 + 1;
	for (auto nxt : g[cur]) {
		if (nxt == pre) continue;
		ll t = all - sz[nxt];
		res[cur] += sz[nxt] * t;
	}
	for (auto nxt : g[cur]) {
		if (nxt == pre) continue;
		dfs(nxt, cur);
	}
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	scanf("%d", &n);
	g.resize(n); sz.resize(n); res.resize(n);
	for (int i = 0; i < n - 1; i++) {
		int u, v; scanf("%d %d", &u, &v);
		u--; v--;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	dfs_sz(0, -1);
	dfs(0, -1);
	for (int i = 0; i < n; i++) printf("%lld\n", res[i]);
	return 0;
}