#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<ctime>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long LL;
const int M=2e5+10;
vector<int> e[M];
bool vis[M];
int fa[M],dep[M],rev[M];
void dfs(int u,int from){
    vis[u]=1;
    rev[u]=0;
    for(int v:e[u]){
        if(v==from) continue;
        if(u>v) rev[u]++;
        fa[v]=u;
        dep[v]=dep[u]+1;
        dfs(v,u);
        rev[u]+=rev[v];
    }
}

int main(){
    int n;
    cin>>n;
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    dfs(1,0);
    //for(int i=1;i<=n;i++){printf("i=%d fa=%d d=%d rev=%d\n",i,fa[i],dep[i],rev[i]);}
    for(int u=1;u<=n;u++){
        cout<<rev[1]+dep[u]-2*rev[u]<< endl;
    }
    return 0;
}