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

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);

using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;

//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;

const int SIZE = 200010;

ll powll(ll n, ll x) {
    // return n ^ x;

    ll ret = 1;
    rep(i, x) ret *= n;

    return ret;
}

struct Edge { ll u, v, cost; };

bool comp(const Edge& e1, const Edge& e2) {
    return e1.cost < e2.cost;
}
bool seen[SIZE];
int sc[SIZE];
void dfs(const Graph &G, int v, int par){

    for(auto nv : G[v]){
        if(nv == par) continue;
        if(nv > v) sc[nv] = sc[v] + 1;
        else sc[nv] = sc[v] - 1;
        dfs(G, nv, v);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    queue<int> q;
    q.push(0);
    int val = 0;
    while(SZ(q)){

        int v = q.front(); q.pop();
        seen[v] = true;
        for(auto nv : G[v]){
            if(seen[nv]) continue;
            if(v > nv) val++;
            q.push(nv);
        }
    }

    sc[0] = val;
    dfs(G, 0, -1);

    rep(i, n){
        cout << sc[i] << endl;
    }

}