import java.io.*; 
import java.math.*;
import java.util.*;
public class Main {  //~IQEmperor~
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		int N = I.nextInt();
		ArrayList<int[]>[] graph = new ArrayList[N+1];
		StringBuilder ret = new StringBuilder();
		for (int i = 1; i <= N; i++) graph[i] = new ArrayList<int[]>();
		//[End vertex, weight of path]
		long[] ans = new long[N+1];
		Arrays.fill(ans, -1);
		ans[1]=0; //DFS done from root node 1
		boolean[] vis = new boolean[N+1];
		boolean[] strand = new boolean[N+1];
		strand[1]=true;
		for (int i = 0; i < N-1; i++) {
			int A = I.nextInt();
			int B = I.nextInt();
			int W = I.nextInt();
			int[] add1 = {B,W};
			int[] add2 = {A,W};
			graph[A].add(add1);
			graph[B].add(add2);
		}
		long dis = 0;
		DFS(graph,1,vis,strand,dis,ans);
		for (int i = 1; i <= N; i++) ret.append(ans[i]+"\n");
		O.pln(ret);
	}
	public static void DFS(ArrayList<int[]>[] graph,int root,boolean[] vis,
	boolean[] strand,long dis,long[] ans) {
		boolean added=false;
		for (int i = 0; i < graph[root].size(); i++) {
			int nbr = graph[root].get(i)[0];
			int W = graph[root].get(i)[1];
			if (!vis[nbr]&&!strand[nbr]) {
				strand[nbr]=true;
				added=true;
				ans[root]=dis%2;
				DFS(graph,nbr,vis,strand,dis+W,ans);
			}
		}
		if (!added) {
			vis[root]=true;
			ans[root]=dis%2;
		}
	}
	public static long min(long a, long b) {return Math.min(a,b);}
	public static long max(long a, long b) {return Math.max(a,b);}
	public static int min(int a, int b) {return Math.min(a,b);}
	public static int max(int a, int b) {return Math.max(a,b);}
	public static long abs(long x, long y) {return Math.abs(x-y);}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	public static int pop(long x) { //Returns number of bits within a number
		int cnt = 0;
		while (x>0) {
			if (x%2==1) cnt++;
			x/=2;
		}
		return cnt;
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
		double nextDouble() {return Double.parseDouble(next());}
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(boolean x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void pln(BigInteger x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
		void p(BigInteger x) {w.print(x);w.flush();}
		void p(double x) {w.print(x);w.flush();}
		void p(boolean x) {w.print(x);w.flush();}
	}
}


Measured memory_bytes: 70432