#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

vector<vector<int>> g;
vector<ll> ans;

ll dfs(int now,int par){
  ll sum=0;
  ll res=0;
  vector<ll> v;
  for(auto nex:g[now]){
    if(nex==par) continue;
    ll val=dfs(nex,now);
    sum+=val;
    v.push_back(val);
  }

  for(auto p:v){
    res+=p*(sum-p);
  }
  res+=2*sum+1;
  ans[now]=res;
  return sum+1;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  g.resize(N);
  rep(i,N-1){
    int a,b;
    cin>>a>>b;
    a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }

  ans.resize(N,0);

  dfs(0,-1);

  rep(i,N) cout<<ans[i]<<"\n";



  return 0;
}