#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

vector<vi> es;
vl ans;
vl cnt;

void calc(int cur, int par) {
    cnt[cur] = 1;
    for(auto&& to : es[cur]) if(to != par) {
        calc(to, cur);
        cnt[cur] += cnt[to];
    }
    ans[cur] += cnt[cur];
    for(auto&& to : es[cur]) if(to != par) {
        ans[cur] += cnt[to] * (cnt[cur] - cnt[to]);
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    es.resize(n);
    rep(i, n-1) {
        int a, b;
        cin >> a >> b;
        --a;--b;
        es[a].emplace_back(b);
        es[b].emplace_back(a);
    }
    ans.resize(n);
    cnt.resize(n);
    calc(0, -1);
    rep(i, n) cout << ans[i] << '\n';
    return 0;
}