#include <iostream>
#include <iomanip>
#include <ostream>
#include <optional>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <ranges>
#include <map>
#include <unordered_map>
using namespace std;

#ifndef INCLUDED_MAIN
#define INCLUDED_MAIN
#include __FILE__



i32 main() {
    i64 n;
    cin >> n;
    vector g(n, vector<i32>());

    for (i32 _=0; _<n-1; _++) {
        i32 a, b;
        cin >> a >> b; a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    vector<i32> ans(n, 0);
    for (i32 i=0; i<n; i++) {
        for (const auto& j : g[i]) {
            ans[j] += g[i].size() - 1;
        }
    }

    cout << ans << endl;
}








/********************************************************************************/
#else

#ifdef ONLINE_JUDGE
#define debug(x) {}
#else
const int DEBUG_PRINT = 10;
const string bold = "\e[1m";
const string cyan = "\e[36m";
const string red = "\e[31m";
const string reset = "\e[0m";
#define debug(x) {cerr << bold << cyan << "[" << red << __LINE__ << cyan << "] "<< #x << ": " << reset; debgp(x); }
template<class T> void debgp(T &x) { cerr << x; }
template<class T, class U> void debgp(pair<T,U> &p) { cerr << "("; debgp(p.first); cerr << ", "; debgp(p.second); cerr << ")"; }
template<class T> void debgp(vector<T> &v) { cerr << "["; for (int i=0; i<min((int)v.size(), DEBUG_PRINT); i++) { debgp(v[i]); cerr << (i+1!=v.size()?" ":"]\n"); } if (v.size() > DEBUG_PRINT) cerr << " … ]\n"; }
template<class T> void debgp(vector<vector<T>> &v) {cerr<<"[\n"; for (int i=0; i<min((int)v.size(), DEBUG_PRINT); i++) { cerr<<" "; debgp(v[i]); } if (v.size() > DEBUG_PRINT) cerr<<" ︙\n"; ;  cerr << "]\n"; }
#endif


using i32 = int;
using i64 = long long;

const i64 INF = 0x0f0f'0f0f'0f0f'0f0f;

template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

vector dx4 = {1, 0, -1, 0};
vector dy4 = {0, 1, 0, -1};
vector dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector dy8 = {0, 1, 1, 1, 0, -1, -1, -1};

template<class T, class U> istream& operator>>(istream&i,pair<T,U>&v){ i>>v.first>>v.second; return i; }
template<class T> istream& operator>>(istream&i,vector<T>&v){ for(T&e : v) i>>e; return i; }
template<class T, class U> ostream& operator<<(ostream &o, pair<T,U> &p){o<<"("<<p.first<<", "<<p.second<<")";return o; }
template<class T> ostream& operator<<(ostream&o,vector<T>&v){for(int i=0; i<v.size(); i++) { o << v[i] << (i+1!=v.size()?"\n":"\n");} return o;}

template<class T> optional<i32> position(vector<T>&v, T x) { auto it = std::find(v.begin(), v.end(), x); if (it == v.end()) return nullopt; return it - v.begin(); }
optional<i32> position(string &v, char x) { auto it = std::find(v.begin(), v.end(), x); if (it == v.end()) return nullopt; return it - v.begin(); }
template<class T> vector<pair<T, i32>> run_length_encoding(vector<T>&v) { vector<pair<T, i32>> res; if (v.empty()) return res; res.emplace_back(v[0], 0); for (const auto& x : v) { if (res.back().first == x) { res.back().second++; } else { res.emplace_back(x, 1); } } return res; }


struct init{init(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}init;
#endif