#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream& operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream& operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N;
constexpr int Nmax = 200001;

vector<int> to[Nmax];
vector<int> ans;
vector<map<int, pint>> dp;
vector<pint> maxs;
vector<int> dp2s;

void predfs(int now, int prv)
{
    if (now > maxs[prv].first) maxs[now] = pint(now, maxs[prv].first);
    else maxs[now] = maxs[prv];

    for (auto nxt : to[now]) if (nxt != prv)
    {
        predfs(nxt, now);
        dp[now][nxt] = pint(1, 0);

        if (nxt < maxs[now].first)
        {
            dp[now][nxt].first++;
            for (auto pa : dp[nxt]) dp[now][nxt].first += pa.second.first - 1;
        }
        if (nxt < maxs[now].second)
        {
            dp[now][nxt].second = 1;
            for (auto pa : dp[nxt]) dp[now][nxt].second += pa.second.second;
        }
    }
}

void dfs(int now, int prv)
{
    if (now > 1)
    {
        if (now > maxs[prv].first) ans[now] = ans[prv] + dp2s[now] + 1;
        else
        {
            ans[now] = ans[prv];
            if (maxs[prv].first == prv) ans[now] = ans[prv] + dp[prv][now].first - dp[prv][now].second - 1;
        }
    }
    for (auto nxt : to[now]) if (nxt != prv) dfs(nxt, now);
}

int main()
{
    cin >> N;
    REP(_, N - 1)
    {
        int a, b;
        cin >> a >> b;
        to[a].push_back(b);
        to[b].push_back(a);
    }

    maxs.resize(N + 1);
    maxs[1] = pint(1, 0);
    // dbg(maxs);

    dp.resize(N + 1);
    predfs(1, 0);
    // dbg(dp);

    dp2s.resize(N + 1);
    FOR(i, 1, N + 1) for (auto pa : dp[i]) dp2s[i] += pa.second.second;
    ans.resize(N + 1);
    dfs(1, 0);
    // dbg(dp2s);

    FOR(i, 2, N) printf("%d ", ans[i]);
    printf("%d\n", ans[N]);
}


Measured memory_bytes: 62592