#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 5
#else
#define SIZE 223450
#endif

int N,M,Q;
set<int> E[SIZE];
int C[SIZE]; // それ以下の頂点数
int R[SIZE]; // 解答

int dfs(int n, int p = -1) {
    int ret = 1;
    for (int to:E[n])if(to!=p) {
        ret += dfs(to, n);
    }
    return C[n]=ret;
}
int dfs2(int n, int p = -1) {
    int ret = 1;
    for (int to:E[n])if(to!=p) {
        ret += (C[n]-C[to])*C[to];
        ret += C[to];
        dfs2(to, n);
    }
    return R[n]=ret;
}

void solve() {
    cin>>N;
    int u,v;
    REP(i,N-1) {
        cin>>u>>v;
        u--;v--;
        E[u].insert(v);
        E[v].insert(u);
    }
    dfs(0);
    dfs2(0);
    REP(i,N)out("%lld\n",R[i]);
}