#include <stdio.h>

typedef struct list {
  int v;
  struct list *n;
} list;

void func1 (int v, list **e, int tmp_d, int *d, int *cnt, int *visited, int *ans) {
  list *l = e[v];
  
  d[v] = tmp_d;
  visited[v] = 1;
  while (l != NULL) {
    if (visited[l->v] <= 0) {
      func1(l->v, e, tmp_d+1, d, cnt, visited, ans);
      cnt[v]++;
      ans[v] += cnt[l->v];
    }
    l = l->n;
  }
  
  return;
}

void func2 (int v, list **e, int *cnt, int *visited, int *ans) {
  list *l = e[v];
  
  visited[v] = 2;
  while (l != NULL) {
    if (visited[l->v] <= 1) {
      func2(l->v, e, cnt, visited, ans);
      ans[l->v] += cnt[v]-1;
    }
    l = l->n;
  }
  
  return;
}

int main () {
 int n = 0;
 int u = 0;
 int v = 0;
 
 int res = 0;
 
 int ans[300000] = {};
 
 int d[300000] = {};
 int dcnt[300002] = {};
 
 list pool[599998] = {};
 int used = 0;
 
 list *e[300000] = {};
 
 int visited[300000] = {};
 int cnt[300000] = {};
 
 res = scanf("%d", &n);
 for (int i = 0; i < n-1; i++) {
   res = scanf("%d", &u);
   res = scanf("%d", &v);
   u--;
   v--;
   pool[used].v = v;
   pool[used].n = e[u];
   e[u] = pool+used;
   used++;
   pool[used].v = u;
   pool[used].n = e[v];
   e[v] = pool+used;
   used++;
 }
 
 func1(0, e, 0, d, cnt, visited, ans);
 func2(0, e, cnt, visited, ans);
 
 for (int i = 0; i < n; i++) {
   dcnt[d[i]]++;
 }
 
 for (int i = 0; i < n; i++) {
   if (d[i] > 1) {
     ans[i] += 1;
   }
   printf("%d\n", ans[i]);
 }
 
 return 0;
}