#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 2e5 + 10;
int pp[MAXN];
int mm[MAXN];
int diff[MAXN];
int ans[MAXN];
vector<int> aa[MAXN];

void remove_subtree(int v, set<int>* S) {
    if (!S->count(v)) return;
    S->erase(v);
    for (int a: aa[v]) {
        if (a == pp[v]) continue;
        remove_subtree(a, S);
    }
}

set<int>* dfs1(int v) {
    set<int>* S = new set<int>();
    S->insert(v);
    mm[v] = max(mm[pp[v]], pp[v]);
    for (int a: aa[v]) {
        if (a == pp[v]) continue;
        pp[a] = v;
        set<int>* Sa = dfs1(a);
        diff[a] = Sa->size();
        while (!Sa->empty() and *(Sa->rbegin()) > mm[v]) remove_subtree(*(Sa->rbegin()), Sa);
        diff[a] -= Sa->size();
        if (Sa->size() > S->size()) swap(Sa, S);
        const set<int>& SS = *Sa;
        for (int x: SS) S->insert(x);
    }
    return S;
}

void dfs2(int v) {
    ans[v] = ans[pp[v]] + diff[v];
    for (int a: aa[v]) {
        if (a == pp[v]) continue;
        dfs2(a);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    int N;
    cin >> N;
    for (int i = 0; i < N-1; i++) {
        int a, b;
        cin >> a >> b;
        aa[a].push_back(b);
        aa[b].push_back(a);
    }
    dfs1(1);
    dfs2(1);
    for (int v = 2; v <= N; v++) cout << ans[v] << " ";
    cout << "\n";
}


Measured memory_bytes: 73600