/* -*- coding: utf-8 -*-
 *
 * 1817.cc:  No.1817 Reversed Edges - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef vector<int> vi;

/* global variables */

vi nbrs[MAX_N];
int ps[MAX_N], cis[MAX_N], res[MAX_N], pres[MAX_N];

/* subroutines */

/* main */

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

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

  ps[0] = -1;
  for (int u = 0; u >= 0;) {
    vi &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	ps[v] = u;
	u = v;
      }
    }
    else {
      if (up >= 0) res[up] += res[u] + (up > u ? 1 : 0);
      u = up;
    }
  }
  //for (int i = 0; i < n; i++) printf("%d ", res[i]); putchar('\n');

  fill(cis, cis + n, 0);
  for (int u = 0; u >= 0;) {
    vi &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	pres[v] = pres[u] + (res[u] - res[v]) + (u > v ? -1 : 1);
	u = v;
      }
    }
    else {
      u = up;
    }
  }

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