/* Problem URL: https://cses.fi/problemset/task/1132 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    
    vvi graph(n);

    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vi dis(n);
    vi ans(n, 0);
    function<int(int, int)> dfs = [&](int i, int p){
        int ret = 0;
        for (auto j : graph[i]) {
            if (j == p) {
                continue;
            }

            rmax(ret, dfs(j, i));
        }

        dis[i] = ret + 1;
        return ret + 1;
    };

    dfs(0, 0);

    function<void(int, int)> getans = [&](int i, int p){
        int a = 0;
        priority_queue<int> pq;

        for (auto j : graph[i]) {
            rmax(a, dis[j]);
            pq.push(dis[j]);
        }

        ans[i] = a;
        dis[i] = a + 1;

        for (auto j : graph[i]) {
            if (j == p) {
                continue;
            }

            if (dis[j] == a) {
                int prev = dis[i];
                pq.pop();
                dis[i] = pq.empty() ? 1 : pq.top() + 1;
                getans(j, i);
                dis[i] = prev;
                pq.push(prev);
            } else {
                getans(j, i);
            }
        }
    };

    getans(0, 0);

    cout << ans;
}