#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const deque<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

vector<int> bf(vv<int> g){
	int n=g.size();
	vector<int> re(n);
	reps(i,1,n){
		priority_queue<int,vector<int>,greater<int>> que; que.emplace(i);
		int cnt=0;
		vector<int> usd(n); usd[i]=1;
		while(que.size()){
			int v=que.top(); que.pop();
			if(!v) break;
			++cnt;
			for(int w:g[v])if(MX(usd[w],1)) que.emplace(w);
		}
		re[i]=cnt;
	}
	return re;
}

vector<int> solve(vv<int> g){
	int n=g.size();
	vector<int> par(n,-1);
	vector<int> mx(n);
	vector<int> sz(n);
	{
		function<int(int,int,int)> dfs=
			[&](int v,int p,int m){
				par[v]=p;
				mx[v]=m;
				sz[v]=1;
				for(int w:g[v])if(p!=w) sz[v]+=dfs(w,v,max(m,v));
				return sz[v];
			};
		dfs(0,-1,0);
	}
	out(par,mx,sz,1);
	vector<int> usd(n);
	vv<pii> h(n);
	int PAR,RE;
	function<void(int,int)> dfs=
		[&](int v,int p){
			if(!MX(usd[v],1)) return;
			h[PAR].eb(v,RE);
			for(int w:g[v])if(p!=w) dfs(w,v);
		};
	int ub;
	function<int(int,int)> dfs2=
		[&](int v,int p){
			if(usd[v]) return 0;
			if(v>ub) return 0;
			int re=1;
			for(int w:g[v])if(p!=w) re+=dfs2(w,v);
			return re;
		};
	function<int(int,int)> dfs3=
		[&](int v,int p){
			if(usd[v]) return 0;
			int re=1;
			for(int w:g[v])if(p!=w) re+=dfs3(w,v);
			return re;
		};
	rreps(i,1,n)if(!usd[i]){
		out(i,usd,1);
		ub=mx[i];
		vector<int> cs(g[i].size());
		rep(j,g[i].size())if(g[i][j]!=par[i] && g[i][j]<i) cs[j]=dfs2(g[i][j],i);//before dfs
		out(i,g[i],cs,1);
		RE=1;
		rep(j,g[i].size())if(g[i][j]!=par[i] && g[i][j]<i) RE+=cs[j];
		PAR=par[i];
		h[PAR].eb(i,RE);
		rep(j,g[i].size())if(g[i][j]!=par[i] && g[i][j]<i){
			int sz=dfs3(g[i][j],i);
			RE-=cs[j]-sz;
			dfs(g[i][j],i);
			RE+=cs[j]-sz;
		}
		usd[i]=1;
	}
	out(h,1);
	queue<int> que; que.emplace(0);
	vector<int> re(n);
	while(que.size()){
		int v=que.front(); que.pop();
		for(pii p:h[v]){
			re[p.X]=p.Y+re[v];
			que.emplace(p.X);
		}
	}
	return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	// rep(_,100){
	// 	int n=_+2;
	// 	vv<int> g(n);
	// 	reps(i,1,n){
	// 		int p=rand()%i;
	// 		g[i].pb(p);
	// 		g[p].pb(i);
	// 	}
	// 	assert(solve(g)==bf(g));
	// }
  int n;
	cin>>n;
	vv<int> g(n);
	rep(i,n-1){
		int a,b;
		cin>>a>>b; --a; --b;
		g[a].pb(b);
		g[b].pb(a);
	}
	// out(bf(g),1);
	auto re=solve(g);
	reps(i,1,n) cout<<re[i]<<" ";cout<<endl;
  return 0;
}


Measured memory_bytes: 51824