/* -*- coding: utf-8 -*-
 *
 * 1098.cc:  No.1098 LCAs - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;

/* global variables */

vi nbrs[MAX_N];
int ps[MAX_N], ss[MAX_N], cns[MAX_N];
ll cs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int v, w;
    scanf("%d%d", &v, &w);
    v--, w--;
    nbrs[v].push_back(w);
    nbrs[w].push_back(v);
  }

  ps[0] = -1;
  qi q;
  q.push(0);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int up = ps[u];

    vi &nbru = nbrs[u];
    for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int v = *vit;
      if (v != up) {
	ps[v] = u;
	cns[u]++;
	q.push(v);
      }
    }
  }

  for (int u = 0; u < n; u++)
    if (cns[u] == 0) q.push(u);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int up = ps[u];

    ss[u]++;
    cs[u] = ss[u];
    vi &nbru = nbrs[u];
    for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int v = *vit;
      if (v != up)
	cs[u] += (ll)ss[v] * (ss[u] - ss[v]);
    }

    if (up >= 0) {
      ss[up] += ss[u];
      if (--cns[up] == 0) q.push(up);
    }
  }

  for (int i = 0; i < n; i++) printf("%lld\n", cs[i]);
  return 0;
}