#ifndef LOCAL
#include <bits/stdc++.h>

using namespace std;

#define debug(...) (void(0))
#else
#include "algo/debug.h"
#endif

namespace std {

template <class Fun>
class y_combinator_result {
    Fun fun_;

   public:
    template <class T>
    explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

    template <class... Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

}  // namespace std

void solve() {
    int N; cin >> N;
    vector<vector<int>> G(N);
    for(int i = 1; i < N; i++) {
        int a, b; cin >> a >> b;
        a--; b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<int64_t> ans(N);
    vector<int> sz(N);
    y_combinator([&](auto self, int v, int p = -1) -> void {
        sz[v] = 1;
        for(const auto&to: G[v]) if(to != p) {
            self(to, v);
            sz[v] += sz[to];
            ans[v] += sz[to];
        }
        int64_t sum = sz[v] - 1;
        for(const auto&to: G[v]) if(to != p) {
            sum -= sz[to];
            ans[v] += sz[to] * sum;
        }
    })(0);
    debug(ans);
    for(int i = 0; i < N; i++) {
        ans[i] *= 2, ans[i] += 1;
        cout << ans[i] << '\n';
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int tt = 1;
    // std::cin >> tt;
    while(tt--) {
        solve();
    }
}