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

//#define int long long
const int MAXN = 2 * 1e5 + 10;
int n;
vector <int> g[MAXN];

void read()
{
    cin >> n;
    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);
    }
}

int fans[MAXN];
int sz[MAXN];
int ans = 0;
bool used[MAXN];

void dfs(int v, int size_comp, int p)
{
    sz[v] = 1;
    int m = 0;
    for (auto i : g[v])
    {
        if (i != p && !used[i])
        {
            dfs(i, size_comp, v);
            sz[v] += sz[i];
            m = max(sz[i], m);
        }
    }
    m = max(m, size_comp - sz[v]);
    if (m <= size_comp / 2)
    {
        ans = v;
    }
}

void find_decomposition(int v, int size, int p)
{
    dfs(v, size, v);
    int u = ans;
    fans[u] = p + 1;
//    dfs(u, size, u);

    used[u] = true;

    for (int i = 0; i < g[u].size(); i++)
    {
        if (!used[g[u][i]])
        {
            int m = sz[g[u][i]];

            if (m > sz[u])
            {
                m = size - sz[u];
            }

            find_decomposition(g[u][i], m, u);
        }
    }
}

void run()
{
    find_decomposition(0, n, -1);
}

void write()
{
    for (int i = 0; i < n; i++)
    {
        cout << fans[i] << " ";
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    read();
    run();
    write();
    return 0;
}