#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define double long double
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mod=1e9+7;
vector<vector<ll> >G(200010);
vector<ll>dp(200010,-1);

vector<ll>ans(200010);
ll dfs(ll i,ll p){
    if(dp[i]>=0)return dp[i];
    ll sum=0;
    for(auto e:G[i]){
        if(e==p)continue;
        sum+=dfs(e,i);
    }
    for(auto e:G[i]){
        if(e==p)continue;
        ans[i]+=(sum-dp[e])*(dp[e]);
    }
    ans[i]+=sum*2;
    ans[i]++;
    sum++;
    dp[i]=sum;
    return sum;
}
signed main(){
    ll n;cin>>n;
    rep(i,n-1){
        ll a,b;cin>>a>>b;
        a--;b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    dfs(0,-1);
    rep(i,n){
        cout<<ans[i]<<endl;
    }
}