#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

vvl G = VV(200001, 0, 0, ll);
vll node(200001, 0);
void dfs(ll now, ll from){
  ll ret = 1;
  for(auto to:G[now]){
    if(to==from) continue;
    dfs(to, now);
    ret += node[to];
  }
  node[now] = ret;
}

vll ans(200001, 0);
void f(ll now, ll from){
  ll ret = 2*node[now] - 1;
  ll s = 0;

  for(auto to:G[now]){
    if(to==from) continue;
    f(to, now);
    s += node[to];
    ret -= node[to]*node[to];
  }
  ret += s * s;
  ans[now] = ret;
}

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  ll root = 1;
  for(int i=0;i<n-1;i++){
    ll a, b;std::cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(root, -1);
  f(root, -1);
  for(int i=1;i<=n;i++) std::cout << ans[i] << '\n';
  return 0;
}