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

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

const int maxn = 2000;

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

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

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));
    }
    for(int i = 1; i <= n; i++) {
        dfs(i, 0, i, 0);
    }
    for(int i = 1; i <= n; i++) {
        int ans = 1;
        for(int j = 1; j <= n; j++) {
            if(dist[i][j] > dist[i][ans]) {
                ans = j;
            }
        }
        cout << ans << " ";
    }
    cout << "\n";
}

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