#include <bits/stdc++.h>
using namespace std;

int main() {
  int N; cin >> N;
  vector<int> Ans(N + 1);
  vector<vector<int>> Graph(N + 1);

  for (int i = 0; i < N - 1; i++) {
    int u, v; cin >> u >> v;
    Graph.at(u).push_back(v);
    Graph.at(v).push_back(u);
  }

  auto DFS = [&](auto DFS, int x, int p) -> void {
    for (int to : Graph.at(x)) {
      if (to == p) continue;
      Ans.at(p)++;
      Ans.at(to) += Graph.at(x).size() - 1;
      DFS(DFS, to, x);
    }
  };
  
  DFS(DFS, 1, 0);
  for (int i = 1; i <= N; i++) cout << Ans.at(i) << endl;
}