#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#endif
using namespace std;
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVV(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);vin(__VA_ARGS__)
#define VV(n,...) RDVV(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define of(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(1,__VA_ARGS__);i>=i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
template<class T>constexpr auto for_range(T s,T a,T b,T c=1){return array{a-s,b,(1-s*2)*c};}
void lin(auto&...a){(cin>>...>>a);}
void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);}
void dec(auto&...a){((--a),...);}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  vec&operator--(){fe(*this,e)--e;return*this;}
  ll size()const{return vector<V>::size();}
  auto&emplace_back(auto&&...a){vector<V>::emplace_back(std::forward<decltype(a)>(a)...);return*this;}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
}
namespace my{
template<class WT>struct edge_with_rev_index{
  int from_,to_;
  WT wt_;
  int rev_idx_;
  edge_with_rev_index()=default;
  edge_with_rev_index(int from,int to,WT wt,int rev_idx):from_(from),to_(to),wt_(wt),rev_idx_(rev_idx){}
};
}
namespace my{
template<class WT,class S,S op(S,S),S connect(S,const edge_with_rev_index<WT>&),S finalize(S,ll),S e()>class RerootingDPTree{
public:
  ll n_;
  vec<vec<edge_with_rev_index<WT>>>edges_;
  vec<vec<S>>dp_;
  vec<S>sum_;
  S operator[](ll i)const{return sum_[i];}
  RerootingDPTree(ll n):n_(n),edges_(n),dp_(n),sum_(n){}
  void add_edges(const vec<ll>&a,const vec<ll>&b){
    fo(i,a.size()){
      edges_[a[i]].eb(a[i],b[i],1,edges_[b[i]].size());
      edges_[b[i]].eb(b[i],a[i],1,edges_[a[i]].size()-1);
    }
  }
  void build(){
    auto dfs=[&](auto&&dfs,ll u,ll p)->S{
      ll deg=edges_[u].size();
      S cum=e();
      dp_[u].resize(deg);
      fo(i,deg){
        ll v=edges_[u][i].to_;
        if(v==p)continue;
        dp_[u][i]=connect(dfs(dfs,v,u),edges_[u][i]);
        cum=op(cum,dp_[u][i]);
      }
      return finalize(cum,u);
    };
    dfs(dfs,0,-1);

    auto dfs2=[&](auto&&dfs2,ll u,ll p)->void{
      ll deg=edges_[u].size();

      vec dp_left(deg+1,e()),dp_right(deg,e());
      fo(i,deg)dp_left[i+1]=op(dp_left[i],dp_[u][i]);
      of(i,deg,1)dp_right[i-1]=op(dp_[u][i],dp_right[i]);

      sum_[u]=finalize(dp_left[deg],u);

      fo(i,deg){
        ll v=edges_[u][i].to_;
        if(v==p)continue;

        ll j=edges_[u][i].rev_idx_;
        dp_[v][j]=connect(finalize(op(dp_left[i],dp_right[i]),u),edges_[v][j]);

        dfs2(dfs2,v,u);
      }
    };
    dfs2(dfs2,0,-1);
  }
};
template<class WT,class M>using RerootingDPTreeMonoidAlias=RerootingDPTree<WT,typename M::S,M::op,M::connect,M::finalize,M::e>;
}
namespace my{entry
void main(){
  LL(N);
  VV(N-1,a,b);dec(a,b);

  struct distance_sum_node{
    using S=ll;
    static S op(S a,S b){return a+b;};
    static S connect(S x,const edge_with_rev_index<ll>&e){return x+(e.from_>e.to_);};
    static S finalize(S x,ll u){return x;};
    static S e(){return 0;}
  };

  RerootingDPTreeMonoidAlias<ll,distance_sum_node>rt(N);
  rt.add_edges(a,b);
  rt.build();

  fo(i,N)pp(rt[i]);
}}