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

#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)

typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef vector<pii> vpi;

const int inf = 1e9;
const int inf64 = 1e18;
const int MOD = inf + 7;
const int N =2e5 + 5;
vi g[N];
int dp[N];
int ans[N];

void dfs(int node , int p){
   dp[node] = 1;
   for(int u : g[node]){
      if(u != p){
         dfs(u , node);
         dp[node] += dp[u];
      }
   }

   ans[node] = dp[node];
   for(int u : g[node]){
      if(u != p){
         ans[node] += dp[u] * (dp[node] - dp[u]);
      }
   }
}
int32_t main(){
   fast;
   int n;
   cin >> n;

   f(i,0,n-1){
      int u,v;
      cin >> u >> v;
      g[u].pb(v);
      g[v].pb(u);
   }

   dfs(1,0);
   f(i,1,n+1)  cout << ans[i] << "\n";

}