#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

vector<int> G[200005];
int cnt[200005];
ll ans[200005];

int dfs(int v, int p){
  int sum = 0;
  vector<int> tmp;
  rep(i,G[v].size()){
    if(G[v][i] == p) continue;
    int res = dfs(G[v][i], v);
    tmp.push_back(res);
    sum += res;
  }

  ll x = sum;
  rep(i,tmp.size()){
    ll a = tmp[i];
    ll b = sum - tmp[i] + 1;
    x += a * b;
  }
  ans[v] = x + 1;
  
  return cnt[v] = sum + 1;
}

int main(){
  int N;
  cin >> N;
  rep(i,N-1){
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }

  dfs(1, -1);
  
  REP(i,1,N+1){
    cout << ans[i] << endl;
  }
  
  return 0;
}