#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
void debug() { cerr << "\n"; }
template <class T> void debug(const T &x) { cerr << x << "\n"; }
template <class T, class... Args> void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
template <class T> void debugVector(const vector<T> &v) {
    for(const T &x : v) {
        cerr << x << " ";
    }
    cerr << "\n";
}
using ll = long long;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

int n;
vector<vector<int>> g;
vector<int> sz;
vector<ll> ans;

int dfs1(int v, int p) {
    if(sz[v] != -1) {
        return sz[v];
    }
    int res = 1;
    for(int u : g[v]) {
        if(u != p) {
            res += dfs1(u, v);
        }
    }
    return (sz[v] = res);
}

void dfs2(int v, int p) {
    ll res = 1;
    for(int i = 0; i < g[v].size(); i++) {
        for(int j = i + 1; j < g[v].size(); j++) {
            int ii = g[v][i];
            int jj = g[v][j];
            if(ii == p || jj == p) {
                continue;
            }
            res += (ll)(sz[ii]) * sz[jj] * 2LL;
        }
    }
    for(int u : g[v]) {
        if(u == p) {
            continue;
        }
        res += 2LL * sz[u];
        dfs2(u, v);
    }
    ans[v] = res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    g.resize(n), sz.resize(n, -1), ans.resize(n, 0);
    for(int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    dfs1(0, -1);
    dfs2(0, -1);
    // debugVector(sz);
    for(int i = 0; i < n; i++) {
        cout << ans[i] << "\n";
    }
}