#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

void dfs(mat &G, vec &ch, vec &sum, vec &num, int v, int p){
    for(ll to : G[v]){
        if(to != p) dfs(G, ch, sum, num, to, v);
    }
    ++num[v];
    if(p != -1) num[p] += num[v];
    ch[v] = num[v] * num[v];
    if(p != -1) sum[p] += ch[v];
}

int main() {
    cin >> N;
    mat G(N, vec(0));
    rep(i,N - 1){
        cin>>A>>B;
        --A; --B;
        G[A].push_back(B);
        G[B].push_back(A);
    }
    vec ch(N, 0), sum(N, 0), num(N, 0);
    dfs(G, ch, sum, num, 0, -1);
    rep(i,N) cout<<ch[i] - sum[i]<<endl;
}