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

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

struct UnionFind{
	vi par,sz;
	UnionFind(int n){
		par.resize(n,-1);
		sz.resize(n,1);
	}
	int Find(int a){
		return par[a]==-1?a:(par[a]=Find(par[a]));
	}
	void Unite(int a,int b){
		a=Find(a);
		b=Find(b);
		if(a==b)return;
		assert(par[a]==-1);
		assert(par[b]==-1);
		par[b]=a;
		sz[a]+=sz[b];
	}
	int Size(int a){
		return sz[Find(a)];
	}
};


const int Nmax=200010;
vi g[Nmax];
int par[Nmax];
vi ch[Nmax];

vector<tuple<int,int,int,int>> qs;

void dfs1(int v,int p,int mx){
	if(v>mx){
		qs.EB(v,0,v,mx);
		qs.EB(mx,1,v,mx);
		mx=v;
	}
	par[v]=p;
	for(auto to:g[v])
		if(to!=p){
			dfs1(to,v,mx);
			ch[v].PB(to);
		}
}

int cnt[Nmax];
int ans[Nmax];
void dfs2(int v,int mx,int cur){
	cur+=cnt[v];
	ans[v]+=cur;
	if(v>mx){
		mx=v;
	}
	for(auto to:ch[v]){
		dfs2(to,mx,cur);
	}
}

signed main(){
	int n=read();
	REP(_,n-1){
		int a=read()-1,b=read()-1;
		g[a].PB(b);
		g[b].PB(a);
		qs.EB(max(a,b),2,a,b);
	}
	dfs1(0,-1,-1);
	
	sort(ALL(qs));
	UnionFind uf(n);
	for(auto q:qs){
		int t=get<1>(q),a=get<2>(q),b=get<3>(q);
		cerr<<t<<" "<<a<<" "<<b<<endl;
		if(t==0){
			for(auto c:ch[a]){
				if(c<a){
					cnt[c]+=uf.Size(c)+1;
				}else{
					cnt[c]+=1;
				}
			}
		}else if(t==1){
			int w=1;
			for(auto c:ch[a]){
				if(c<b){
					int s=uf.Size(c);
					w+=s;
					cnt[c]-=1+s;
				}else
					cnt[c]-=1;
			}
			cerr<<a<<" "<<w<<endl;
			cnt[a]+=w;
		}else{
			uf.Unite(a,b);
		}
	}
	cerr<<vi{cnt,cnt+n}<<endl;
	cerr<<vi{ans,ans+n}<<endl;
	dfs2(0,-1,0);
	FOR(i,1,n)
		print(ans[i]-1,i==n-1?1:2);
}


Measured memory_bytes: 57572