#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int in[100005];
int out[100005];
vector<int>to[200005];
int c;
void dfs(int v, int d = 0, int p = -1) {
	in[v] = c;
	c++;
	for (int e : to[v]) {
		if (p == e) continue;
		dfs(e, d + 1, v);
	}
	out[v] = c;
	c++;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<P>edge(n - 1);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		to[a].push_back(b);
		to[b].push_back(a);
		edge[i] = { min(a,b),max(a,b) };
	}
	dfs(0);
	vector<int>sum(2 * n + 1);
	/*rep(i, n) cout << in[i];
	cout << endl;
	rep(i, n) cout << out[i];
	cout << endl;*/
	rep(i, n - 1) {
		int l = edge[i].first;
		int r = edge[i].second;
		//cout << in[r] << " " << out[r] << endl;
		if (in[l] < in[r]) {
			sum[in[r]]++;
			sum[out[r] + 1]--;
		}
		else {
			sum[0]++;
			sum[2 * n + 1]--;
			sum[in[l]]--;
			sum[out[l] + 1]++;
		}
	}
	rep(i, n * 2)sum[i + 1] += sum[i];
	rep(i, n) cout << sum[in[i]] << endl;
	return 0;
}