#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<"\n";}
typedef long long ll;

using Graph=vector<vector<int>>;
Graph G;


vector<int> depth;
vector<int> subtree_size;
vector<int>ans;
void dfs(const Graph &G, int v, int p, int d)
{
    depth[v] = d;
    for (auto nv : G[v])
    {
        if (nv == p)
            continue; // nv が親 p だったらダメ
        dfs(G, nv, v, d + 1);
    }

    // 帰りがけ時に、部分木サイズを求める
    subtree_size[v] = 1; // 自分自身
    for (auto c : G[v])
    {
        if (c == p)
            continue;
        subtree_size[v] += subtree_size[c]; // 子のサイズを加える
    }
   
}


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin>>n;
    G.assign(n,vector<int>());
    depth.resize(n,0);
    subtree_size.resize(n,0);
    for (int i = 0; i < n-1; i++)
    {
        int u,v;
        cin>>u>>v;
        u--,v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(G,0,-1,0);
    vector<int>used(n,false);
    for (int i = 0; i < n; i++)
    {
        used[i]=true;
        int cnt=1;
        int c=0;
        int sum=0;
        for(auto &u : G[i]){
            if(used[u])continue;
            //cerr<<subtree_size[u]<<endl;
            cnt*=subtree_size[u];
            c+=subtree_size[u];
            sum++;
        }
        if(sum==0){
            cout<<1<<endl;
        }
        else if (sum==1){
            cout<<1+2*c<<endl;
        }
        else cout<<2*cnt+2*c+1<<endl;
    }
    
    
    return 0;
}