#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<vector<int>> graph(n);
  REP(_, n - 1) {
    int v, w; cin >> v >> w; --v; --w;
    graph[v].emplace_back(w);
    graph[w].emplace_back(v);
  }
  vector<int> par(n, -1), sub(n, 1);
  function<void(int)> dfs = [&](int ver) {
    for (int e : graph[ver]) {
      if (e != par[ver]) {
        par[e] = ver;
        dfs(e);
        sub[ver] += sub[e];
      }
    }
  };
  dfs(0);
  REP(i, n) {
    ll ans = sub[i];
    for (int e : graph[i]) {
      if (e != par[i]) ans += 1LL * sub[e] * (sub[i] - sub[e]);
    }
    cout << ans << '\n';
  }
  return 0;
}