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

int n;
vector<vector<pair<int, int>>>g;
vector<int>dist;

void dfs(int v)
{
    for(auto [u, d] : g[v]) if(dist[u] == -1) {dist[u] = dist[v] ^ d; dfs(u);}
}

int veg[3200001];
int t[3200001][2];
int cnt = 1;

void update(int u)
{
    int v = dist[u];
    int x = 1;
    for(int i = 31; i >= 0; i--)
    {
        int k = (v >> i) & 1;
        if(t[x][k] == 0) t[x][k] = ++cnt;
        x = t[x][k];
    }
    veg[x] = u+1;
}

int query(int v)
{
    int x = 1;
    for(int i = 31; i >= 0; i--)
    {
        int k = (v >> i) & 1;
        if(t[x][k ^ 1]) x = t[x][k ^ 1];
        else x = t[x][k];
    }
    return veg[x];
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	cin >> n;
    g.resize(n); dist.resize(n, -1);
    for(int i = 1; i < n; i++)
    {
        int a, b, c; cin >> a >> b >> c; --a; --b;
        g[a].push_back({b, c});
        g[b].push_back({a, c});
    }
    dist[0] = 0;
    dfs(0);
    for(int i = 0; i < n; i++) update(i);
    for(int u : dist)
    {
        cout << query(u) << " ";
    }
}