#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
vector<ll> num;
vector<ll> ans;
vector<vector<int>> edge;
int dfs(int now, int prev) {
    int sum = 0;
    for(auto next : edge[now]) {
        if(next != prev) {
            int tmp = dfs(next, now);
            num[next] = tmp;
            sum += tmp;
        }
    }
    return sum + 1;
}
ll solve(int now, int prev) {
    ll res = num[now] * num[now];
    ll sub = 0;
    for(auto next : edge[now]) {
        if(next != prev) {
            ll tmp = solve(next, now);
            sub += tmp;
        }
    }
    ans[now] = res - sub;
    return res;
}
int main() {
    int n;
    cin >> n;
    edge.resize(n);
    for(int i = 0; i < n - 1; i++) {
        int v, w;
        cin >> v >> w;
        edge[v - 1].push_back(w - 1);
        edge[w - 1].push_back(v - 1);
    }
    num.resize(n, -1);
    ans.resize(n, 0);
    num[0] = dfs(0, -1);
    solve(0, -1);
    for(int i = 0; i < n; i++) {
        cout << ans[i] << endl;
    }
}