#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e18;

vector<ll> to[200100];
ll par[200100];
ll dp[200100];

void dfs1(ll v,ll p=-1){
    par[v]=p;
    for(auto x:to[v]){
        if(x==p) continue;
        dfs1(x,v);
    }
    return ;
}

void dfs(ll v,ll p=-1){
    ll res=0;
    for(auto x:to[v]){
        if(x==p) continue;
        dfs(x,v);
        res+=dp[x];
    }
    dp[v]=res+1;
    return;
}

int main(){
    ll n;
    cin >> n;
    rep(i,n-1){
        ll v,w;
        cin >> v >> w;
        v--; w--;
        to[v].push_back(w);
        to[w].push_back(v);
    }
    dfs1(0);
    dfs(0);
    rep(i,n){
        //cout << dp[i] << endl;
    }
    rep(i,n){
        ll ans=1;
        for(auto x:to[i]){
            if(x==par[i]) continue;
            ans*=dp[x]+1;
        }
        ans=ans*2-1;
        cout << ans << endl;
    }
}