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

#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int maxn = 1e5;
const int bits = 30;

int n;
vector<pair<int, int> > g[maxn + 1];
int dist[maxn + 1];

void dfs(int cur, int par) {
    for(pair<int, int> p : g[cur]) {
        if(p.fi != par) {
            dist[p.fi] = dist[cur] ^ p.se;
            dfs(p.fi, cur);
        }
    }
}

struct node {
    int to[2];
    int val;
    node() {
        to[0] = to[1] = val = -1;
    }
};

vector<node> trie;

void add(int x, int idx) {
    int cur = 0;
    for(int b = bits - 1; b >= 0; b--) {
        bool c = (x >> b) & 1;
        if(trie[cur].to[c] == -1) {
            trie[cur].to[c] = trie.size();
            trie.pb(node());
        }
        cur = trie[cur].to[c];
    }
    trie[cur].val = idx;
}

int best(int x) {
    int cur = 0;
    for(int b = bits - 1; b >= 0; b--) {
        bool c = (x >> b) & 1;
        if(trie[cur].to[!c] == -1) {
            cur = trie[cur].to[c];
        } else {
            cur = trie[cur].to[!c];
        }
    }
    return trie[cur].val;
}

void solve() {
    cin >> n;
    for(int i = 1; i < n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].pb(mp(b, c));
        g[b].pb(mp(a, c));
    }
    dfs(1, 0);
    trie.assign(1, node());
    for(int i = 1; i <= n; i++) {
        add(dist[i], i);
    }
    for(int i = 1; i <= n; i++) {
        cout << best(dist[i]) << " ";
    }
    cout << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}