#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ll inf=999999999999999999;
vector<ll>dp(200000,-1);
vector<ll>ans(200000,-1);
void dfs(ll now,vector<vector<ll>>&g){
    dp[now]=0;
    for (ll i = 0; i < g[now].size(); i++)
    {
        if (dp[g[now][i]]==-1)
        {
            dfs(g[now][i],g);
            dp[now]+=dp[g[now][i]];
            if (now>g[now][i])
            {
                dp[now]+=1;
            }
        }
    }
}
void dfs2(ll now,ll oya,vector<vector<ll>>&g){
    if (now!=0)
    {
        if (now>oya)
        {
            ans[now]=ans[oya]+1;
        }else{
            ans[now]=ans[oya]-1;
        }
    }
    for (ll i = 0; i < g[now].size(); i++)
    {
        if (g[now][i]!=oya)
        {
            dfs2(g[now][i],now,g);
        }
    }
}
int main(){
    ll n;
    cin >> n;
    vector<vector<ll>>g(n);
    for (ll i = 0; i < n-1; i++)
    {
        ll a,b;
        cin >> a >> b;
        a--,b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dfs(0,g);
    ans[0]=dp[0];
    dfs2(0,-1,g);
    for (ll i = 0; i < n; i++)
    {
        cout << ans[i] << endl;
    }
    
}