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

int main() {
    int N;
    cin >> N;
    vector<vector<int>>ki(N);
    for(int i = 0; i < N-1; i++) {
        int A,B;
        cin >> A >> B;
        A--;
        B--;
        ki[A].push_back(B);
        ki[B].push_back(A);
    }
    vector<int>dist(N,-1);
    queue<int>que;
    que.push(0);
    dist[0] = 0;
    int ans = 0;
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        for(int i:ki[x]) {
            if(dist[i] != -1) {
                continue;
            }
            dist[i] = dist[x]+1;
            que.push(i);
            if(x > i) {
                ans++;
            }
        }
    }
    vector<int>fans(N,-1);
    que.push(0);
    fans[0] = ans;
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        for(int i:ki[x]) {
            if(fans[i] != -1) {
                continue;
            }
            fans[i] = fans[x];
            que.push(i);
            if(x > i) {
                fans[i]--;
            }
            else {
                fans[i]++;
            }
        }
    }
    for(int i = 0; i < N; i++) {
        cout << fans[i] << endl;
    }
}