#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

vi to[MX];
vi mx;
vi pa;

void mfs(int v, int x=-1, int p=-1) {
  pa[v] = p;
  maxs(x,v);
  mx[v] = x;
  for (int u : to[v]) {
    if (u == p) continue;
    mfs(u,x,v);
  }
}

vi rt, ans;
int cfs(int v, int x, int p=-1) {
  if (v > x) return 0;
  int res = 1;
  for (int u : to[v]) {
    if (u == p || rt[u] != -1) continue;
    res += cfs(u,x,v);
  }
  return res;
}
void sfs(int v, int sv, int val, int p=-1) {
  rt[v] = sv;
  ans[v] = val;
  for (int u : to[v]) {
    if (u == p || rt[u] != -1) continue;
    sfs(u,sv,val,v);
  }
}

int main() {
  int n;
  scanf("%d",&n);
  rep(i,n-1) {
    int a,b;
    scanf("%d%d",&a,&b);
    --a; --b;
    to[a].pb(b);
    to[b].pb(a);
  }
  mx = pa = vi(n);
  mfs(0);

  rt = vi(n,-1);
  ans = vi(n);
  drep(v,n) if (v && rt[v] == -1) {
    int p = pa[v], m = mx[p];
    int s = sz(to[v]);
    vi cnt(s), t(s);
    int sum = 1;
    rep(i,s) {
      int u = to[v][i];
      if (u == p || rt[u] != -1) continue;
      cnt[i] = cfs(u,m,v);
      t[i] = cfs(u,INF,v);
      sum += cnt[i];
    }
    rep(i,s) {
      int u = to[v][i];
      if (u == p || rt[u] != -1) continue;
      int now = sum-cnt[i]+t[i];
      sfs(u,v,now,v);
    }
    rt[v] = v;
    ans[v] = sum;
  }

  vp ps;
  rep(v,n) if (v) ps.pb(P(rt[v],v));
  sort(rng(ps));
  for (auto p : ps) {
    int v = p.se;
    ans[v] += ans[pa[rt[v]]];
  }

  ans.erase(ans.begin());
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 35704