#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector g(n, vector(0, 0));
	for(int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v;
		--u, --v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	vector diff(n, 0);
	auto dfs = [&](auto dfs, int now = 0, int per = -1) -> int {
		int ret = 0;
		for(auto to : g[now]) {
			if(to == per) continue;
			diff[to] = diff[now] + (to > now ? 1 : -1);
			ret += dfs(dfs, to, now) + (to < now);
		}
		return ret;
	};
	int root_res = dfs(dfs);
	for(int i = 0; i < n; i++) cout << root_res + diff[i] << endl;
}