/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1e6+10;
int an[SIZE];
int mi[SIZE];
bool u[SIZE];
VI e[SIZE];
void solve(int x0,int ma,int base){
    VI bfs{x0};
    VI from{-1};
    u[x0]=1;
    REP(i,SZ(bfs)){
        int x=bfs[i];
        for(int y:e[x]){
            if(!u[y]&&y<=ma){
                u[y]=1;
                if(from[i]==-1)from.PB(y);
                else from.PB(from[i]);
                bfs.PB(y);
            }
        }
    }
    if(x0<=ma){
        base+=SZ(bfs);
        for(int me: bfs){
            an[me]=max(an[me],base);
            for(int y:e[me]){
                if(!u[y]){
                    solve(y,ma,base);
                }
            }
        }
    }
    else{
        map<int,int>AA;
        REPP(i,1,SZ(bfs))AA[from[i]]++;
        an[x0]=max(an[x0],SZ(bfs)+base);
        REPP(i,1,SZ(bfs)){
            an[bfs[i]]=max(an[bfs[i]],SZ(bfs)+base);
            u[bfs[i]]=0;
        }
        for(int y:e[x0]){
            if(!u[y]){
                if(y>ma){
                    solve(y,x0,base+SZ(bfs));
                }
            }
        }
        REPP(i,1,SZ(from)){
            if(from[i]==bfs[i]){
                solve(bfs[i],x0,base+SZ(bfs)-AA[bfs[i]]);
            }
        }
    }
}
void go(int x){
    an[x]=1;
    u[x]=1;
    for(int y:e[x]){
        if(y==1)continue;
        solve(y,x,1);
    }
}
int main(){
    int n; R(n);
    REPP(i,1,n){
        int x,y; R(x,y);
        e[x].PB(y);
        e[y].PB(x);
    }
    u[1]=1;
    for(int x:e[1]){
        go(x);
    }
    W(VI(an+2,an+n+1));
    return 0;
}


Measured memory_bytes: 39532