#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

int main(){
    int N;
    cin>>N;
    vector<vector<int>> graph(N);
    REP(i,N-1){
        int a,b; cin>>a>>b;
        a--;b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    vector<ll> ch(N);
    vector<vector<int>> chs(N);
    function<ll(int,int)> dfs = [&](int u,int pre){
        ll res = 1;
        for(auto v:graph[u]){
            if(v == pre) continue;
            res += dfs(v,u);
            chs[u].push_back(v);
        }
        return ch[u] = res;
    };
    dfs(0,-1);
    REP(i,N){
        ll ans = ch[i]*ch[i];
        for(auto v:chs[i]){
            ans -= ch[v]*ch[v];
        }
        cout<<ans<<"\n";
    }
}