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

int main() {
    int N; cin >> N;
    vector<vector<int>> T(N);
    for(int i = 0; i < N-1; i++) {
        int a,b; cin >> a >> b;
        a--,b--;
        T[a].push_back(b);
        T[b].push_back(a);
    }
    vector<int> par(N,-1), cnt(N);

    auto dfs = [&](auto dfs, int i, int p) -> void{
        par[i] = p;
        for(auto ni : T[i]) {
            if(ni == p) continue;
            cnt[i]++;
            dfs(dfs,ni,i);
        }
    };

    dfs(dfs,0,-1);

    for(int i = 0; i < N; i++) {
        int ans = 0;
        if(par[i] != -1 && par[par[i]] != -1) ans++;
        for(int ni : T[i]) {
            if(par[ni] == i) ans += cnt[ni];
        }
        if(par[i] != -1) ans += cnt[par[i]] - 1;

        cout << ans << endl;
    }

}