#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int N;
vector<vector<int>> G;
vector<ll> A;

int dfs(int v,int p = - 1) {
    int cnt = 1;
    ll ans = 1;
    for (int e:G[v]) {
        if (e == p) continue;
        int num = dfs(e,v);
        ans += (ll)cnt * num;
        cnt += num;
    }
    A[v] = 2*ans - 1;
    return cnt;
}

int main() {
    cin >> N;
    G.resize(N);
    A.resize(N);
    rep(i,N - 1) {
        int a,b; cin >> a >> b;
        --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    dfs(0);
    rep(i,N) {
        cout << A[i] << endl;
    }
    return 0;
}