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

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

template<class Operator> class Tree {
	Operator Op;                            
	using typeDist = decltype(Op.unitDist); 
	size_t num;
	size_t is_weighted;
	size_t bit;
	size_t ord;
	struct Node{
		vector<pair<int,typeDist>> edge;
		size_t depth;
		typeDist dist;
		size_t size;
		Node():depth(0),size(1){}
	};
	vector<Node> tree;
	vector<size_t> order;
public:
	Tree(const int num, const int bit = 20):num(num),is_weighted(is_weighted),tree(num),order(num){}
	//O(1) anytime
	void makeEdge(const int& from, const int& to, const typeDist& w = 1) {
		tree[from].edge.push_back({to,w});
	}
	//O(N) anytime
	void makeDepth(const int root) {
		tree[root].depth = 0;
		tree[root].dist = Op.unitDist;
		ord = 0;
		dfs1(root);
		order[ord++] = root;
	}
	//for makeDepth
	void dfs1(int curr, int prev = -1){
		for(auto& e: tree[curr].edge){
			int next = e.first;
			if(next==prev) continue;
			tree[next].depth = tree[curr].depth + 1;
			tree[next].dist  = Op.funcDist(tree[curr].dist,e.second);
			dfs1(next,curr);
			order[ord++] = next;
		}
	}
	Node& operator[](size_t idx) {
		return tree[idx];
	}
};
template<class typeDist> struct treeOperator{
	typeDist unitDist = 0;
	typeDist funcDist(const typeDist& parent,const typeDist& w){return parent+w;}
};
 
//depth,dist
//https://atcoder.jp/contests/abc126/tasks/abc126_d
 
//lca
//https://atcoder.jp/contests/abc014/tasks/abc014_4
 
//child
//https://atcoder.jp/contests/abc133/tasks/abc133_e

//diameter
//https://atcoder.jp/contests/agc033/tasks/agc033_c

//eulerTour
//https://yukicoder.me/problems/no/900

int main() {
	SPEED
	int N; cin >> N;
	Tree<treeOperator<ll>> tree(N,1);
	for(int i = 0; i < N-1; ++i){
		int u,v; ll w; cin >> u >> v >> w;
		u--,v--;
		tree.makeEdge(u,v,w);
		tree.makeEdge(v,u,w);
	}
	tree.makeDepth(0);
	for(int i = 0; i < N; ++i) cout << tree[i].dist%2 << endl;

	return 0;
}


Measured memory_bytes: 11904