#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define endl "\n"
const ll N=4e5+10;
ll n,d[N],up[N],cnt[N],re[N],ucnt[N],id[N];
vector<int>e[N];
void dfs1(int u,int from){
	cnt[u]=1;
	ucnt[u]=1+ucnt[from];
	
	for(int i=0;i<e[u].size();i++){
		int v=e[u][i];
		if(v==from)
			continue;
		
		dfs1(v,u);
		
		d[u]+=cnt[v]+d[v];
		cnt[u]+=cnt[v];
	}
}
void dfs2(int u,int from){
	for(int i=0;i<e[u].size();i++){
		int v=e[u][i];
		if(v==from)
			continue;
		up[v]=up[u]+n-cnt[u]+d[u]-d[v]-cnt[v]+cnt[u]-cnt[v];
		dfs2(v,u);
	}
}
void dfs3(int u,int from){
	for(int i=0;i<e[u].size();i++){
		int v=e[u][i];
		if(v==from)
			continue;
		
		dfs3(v,u);
		if(re[u]>re[v]){
			re[u]=re[v];
			id[u]=id[v];
		}
	}
}
void solve()
{
	cin>>n;
	for(int i=1;i<=n-1;i++){
		ll a,b;
		cin>>a>>b;
		
		e[a].push_back(b);
		e[b].push_back(a);
	}

	dfs1(1,0);
	dfs2(1,0);
	for(int i=1;i<=n;i++)
		re[i]=d[i]+up[i],id[i]=i;
	dfs3(1,0);
	for(int i=1;i<=n;i++){
		cout<<id[i]<<endl;
	}
//	for(int i=1;i<=n;i++){
//		cout<<d[i]<<' '<<up[i]<<endl;
//	}
}
int main()
{
	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1;
//	cin >> t;
	while (t--) {
		solve();
	}
	
	return 0;
}