#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long ll;

int n, a, b, dp[200000], ds[200000], a[200000];
vector<int> g[200000];

int c(int p, int pr) {
    dp[p] = 1;
    for(int i: g[p])
        if(pr != i)
            dp[p] += c(i, p);
}

void f(int p, int pr) {
    for(int i: g[p])
        if(pr != i) {
            ds[i] += ds[p] + 1;
            f(i, p);
        }
}

void dfs(int p, int pr) {
    for(int i: g[p])
        if(pr != i) {
            a = (sum = sum - dp[i] + (n - dp[i]));
        }
}

int main()
{
    cin >> n;
    for(int i = 0; i < n - 1; ++i)
        cin >> a >> b, g[a - 1].push_back(b - 1), g[b - 1].push_back(a - 1);
    ds[0] = 0;
    c(0, -1);
    f(0, -1);
    int sum = 0;
    for(int i = 0; i < n; ++i)
        sum += ds[i];
    cout << sum << " ";
    for(int i: g[0])
        dfs(i, 0);
    for(int i = 1; i < n; ++i)
        cout << (sum = sum - dp[i] + (n - dp[i])) << " ";
    cout << endl;
}