#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int n;
vector<vector<int>> tree(n,vector<int>());
vector<int> ans(n,0);

pll dfs(int i,int before=-1){
    ll res = 0;
    ll sz = 1;

    for(int j:tree[i]){
        if(j==before) continue;
        pll p =  dfs(j,i);
        sz += p.first;
        res += p.second;
    }

    ll q = sz*sz;
    ans[i] = q - res;
    return pll(sz,res + ans[i]);
}

int main(){
    int n;
    cin >> n;
    tree.resize(n);
    ans.resize(n);
    rep(i,n-1){
        int u,v;
        cin >> u >> v;
        --u;--v;
        tree[u].push_back(v);
        tree[v].push_back(u);
    }
    dfs(0);
    rep(i,n){
        cout << ans[i] << endl;
    }
    return 0;
}