#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

ll n;
vector<vector<ll>> g;
vector<ll> dp, ans;

ll dfs(ll v, ll p = -1) {
    dp[v] = 1;
    for(auto &u : g[v]) {
        if (u == p) continue;
        dp[v] += dfs(u, v);
    }
    return dp[v];
}

ll dfs2(ll v, ll p = -1) {
    ans[v] = 1;
    for(auto &u : g[v]) {
        if (u == p) continue;
        ans[v] *= dp[u] + 1;
        dfs2(u, v);
    }
    ans[v] = ans[v] * 2 - 1;
    return ans[v];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cin >> n;
    g.resize(n);
    rep(i, n - 1) {
        ll v, w;
        cin >> v >> w;
        v--; w--;
        g[v].push_back(w);
        g[w].push_back(v);
    }
    dp.resize(n, 0);
    dfs(0);
    ans.resize(n, 0);
    dfs2(0);
    rep(i, n) cout << ans[i] << endl;
    return 0;
}