#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, m;

vector<vector<pair<int, int>>> G(100010);

int ans[100010];

int main() {
    //cout << fixed << setprecision(15);

    int N = readInt();
    REP(i, 100010) ans[i] = -1;
    REP(i, N-1){
        int u, v, w; cin >> u >> v >> w;
        u--;
        v--;
        G[u].push_back(make_pair(v, w));
        G[v].push_back({u, w});
    }
    queue<pair<int, int>> q;
    q.push({0, 1});
    ans[0]=1;
    while(q.size()){
        pair<int, int> p = q.front();
        q.pop();
        
        int v = p.first;
        int bin = p.second;
        
        for(int i=0; i<(int)G[v].size(); ++i){
            int u = G[v][i].first;
            if(ans[u]!=-1) continue;
            
            int len = G[v][i].second;
            if(len%2==0){
                if(bin == 0){
                    ans[u] = 0;
                    q.push({u, 0});
                }else{
                    ans[u] = 1;
                    q.push({u, 1});
                }
            }else{
                if(bin == 0){
                    ans[u] = 1;
                    q.push({u, 1});
                }else{
                    ans[u] = 0;
                    q.push({u, 0});
                }
            }
        }
    }
    for(int i=0; i<N; ++i) cout << ans[i] << endl;
    return 0;
}

Measured memory_bytes: 6784