#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int n;
vector<int> G[100010];
int dp1[100010],dp2[100010];

void dfs1(int s,int par){
    for(int t:G[s]){
        if(t==par) continue;
        dfs1(t,s);
        dp1[s]+=dp1[t]+(t<s);
    }
}

void dfs2(int s,int par,int dp_par){
    dp2[s]=dp1[s]+dp_par;
    for(int t:G[s]){
        if(t==par) continue;
        int D=dp_par+dp1[s]-dp1[t];
        if(s>t) D--;
        else D++;
        dfs2(t,s,D);
    }
}

void solve(){
    cin >> n;
    rep(i,n-1){
        int a,b;cin >> a >>b;a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    dfs1(0,-1);
    dfs2(0,-1,0);
    rep(i,n) cout << dp2[i] << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}