#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

struct node {
    node * lf;
    node * rf;
    int val;

    node() {
        val = 0;
        lf = NULL;
        rf = NULL;
    }
};


void upd(node * root, int tl, int tr, int pos, int val) {
    if (tl == tr) {
        root->val = val;
        return;
    }
    int tm = tl + tr >> 1;
    if (pos <= tm) {
        if (!root->lf)
            root->lf = new node();

        upd(root->lf, tl, tm, pos, val);
    } else {
        if (!root->rf)
            root->rf = new node();

        upd(root->rf, tm + 1, tr, pos, val);
    }
    root->val = 0;
    if (root->lf)
        root->val += root->lf->val;

    if (root->rf) 
        root->val += root->rf->val;

}

int get(node * root, int tl, int tr, int l, int r) {
    if (l > r)
        return 0;
    if (tl == l && tr == r)
        return root->val;
    int tm = tl + tr >> 1;
    int ret = 0;
    if (root->lf)
        ret += get(root->lf, tl, tm, l, min(tm, r));
    if (root->rf)
        ret += get(root->rf, tm + 1, tr, max(tm + 1, l), r);
    return ret;
}

const int N = 2e5 + 10;

vi _g[N], g[N];
int cnt[N];
int n;

void hang(int v, int par) {
    cnt[v] = 1;
    int mx = -1, id = -1 ;
    fori (i, _g[v].size()) {
        int to = _g[v][i];
        if (to == par)
            continue;
        g[v].push_back(to);
        hang(to, v);
        cnt[v] += cnt[to];
        if (cnt[to] > mx) {
            mx = cnt[to];
            id = SZ(g[v]) - 1;
        }
    }

    if (id != -1) {
        swap(g[v][id], g[v][0]);
    }
}

int ch[N];
int ans[N];

void dfs(int v, node * root, set<int> & st, int mx_up) {

    if (g[v].empty()) {
        upd(root, 0, n, v, 1);
        st.insert(v);
        ans[v] = 1;
        return;
    }
    int to = g[v][0];
    dfs(to, root, st, max(mx_up, v));

    ans[v] = 1;
    ans[v] += ch[to] = get(root, 0, n, 0, mx_up);

    for (int i = 1; i < g[v].size(); ++i) {
        int to = g[v][i];
        node * cur_root = new node();
        set<int> cur_st;
        dfs(to, cur_root, cur_st, max(mx_up, v));
        ans[v] += ch[to] = get(cur_root, 0, n, 0, mx_up);
        for (auto x : cur_st) {
            upd(root, 0, n, x, get(cur_root, 0, n, x, x));
        }
        st.insert(ALL(cur_st));
    }
    upd(root, 0, n, v, 1 + get(root, 0, n, 0, v));
    st.insert(v);
    while (*st.begin() < v) {
        int u = *st.begin();
        st.erase(st.begin());
        upd(root, 0, n, u, 0);
    }
}

void dfs2(int v, int ans_up) {
    ans[v] += ans_up;
    ans_up += 1;
    for (auto to : g[v]) {
        ans_up += ch[to];
    }
    for (auto to : g[v]) {
        ans_up -= ch[to];
        dfs2(to, ans_up);
        ans_up += ch[to];
    }
}

void smain() {
    cin >> n;
    fori (_, n - 1) {
        int u, v;
        cin >> u >> v;
        _g[u].push_back(v);
        _g[v].push_back(u);
    }

    hang(1, -1);
    node * root = new node();
    set<int> st;
    dfs(1, root, st, 0);
    dfs2(1, 0);
    for (int v = 2; v <= n; ++v) {
        cout << ans[v] - 1 << ' ';
    }
}

Measured memory_bytes: 327808