#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

ll N;
ll cnt[200000];
ll ans[200000];
vector<int> G[200000];
bool used[200000];

void dfs(int v){
    cnt[v] = 1;
    used[v] = true;
    ll sum = 0;
    ll sum_pow_2 = 0;
    for(int to : G[v]){
        if(!used[to]){
            dfs(to);
            cnt[v] += cnt[to];
            sum += cnt[to];
            sum_pow_2 += (cnt[to]*cnt[to]);
        }
    }
    ans[v] = (sum*sum-sum_pow_2);
    ans[v] += 2*cnt[v]-1;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N;
    for(int i = 0; i < N-1; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(0);
    for(int i = 0; i < N; i++) cout << ans[i] << endl;
}