#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 1000000007;

int N, MAX_N = 2000001, idx = 0, MAX_LOG_V = 20;
vector<vector<int>> edge(MAX_N), parent(MAX_LOG_V, vector<int>(MAX_N, -1));
vector<int> tp(MAX_N), l(MAX_N), r(MAX_N), par(MAX_N, -1), depth(MAX_N, 0);
vector<bool> done(MAX_N, false);

void tps(int u) {
    done[u] = true;
    l[u] = idx;
    tp[idx] = u;
    idx++;
    REP(i, edge[u].size()) {
        int v = edge[u][i];
        if (done[v]) continue;
        par[v] = u;
        depth[v] = depth[u] + 1;
        tps(v);
    }
    r[u] = idx;
}

int main() {
    int N;
    cin >> N;
    vector<int> A(N - 1), B(N - 1);
    REP(i, N - 1) cin >> A[i] >> B[i];
    REP(i, N - 1) {
        edge[A[i] - 1].push_back(B[i] - 1);
        edge[B[i] - 1].push_back(A[i] - 1);
    }
    tps(0);
    vector<int> C(N, 0), D(N, 0);
    for (int i = N - 1; i > 0; i--) {
        int u = tp[i], v = par[u];
        C[v] += C[u];
        if (u < v) C[v]++;
    }
    FOR(i, 1, N) {
        int u = tp[i], v = par[u];
        D[u] = D[v];
        if (u > v) D[u]++;
        else D[u]--;
    }
    /*
    REP(i, N) cout << tp[i] << " "; cout << "\n";
    REP(i, N) cout << par[i] << " "; cout << "\n";
    REP(i, N) cout << l[i] << " "; cout << "\n";
    REP(i, N) cout << r[i] << " "; cout << "\n";
    REP(i, N) cout << C[i] << " "; cout << endl;
    REP(i, N) cout << D[i] << " "; cout << endl;
    */
    REP(i, N) cout << C[0] + D[i] << endl;
}