import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	long[2][] nodes;
	auto edges = new long[2][][](N);
	foreach (i; 0..N-1)
	{
		auto u = RD-1;
		auto v = RD-1;
		auto w = RD;
		edges[u] ~= [v, w];
		edges[v] ~= [u, w];
	}

	long pos;
	foreach (i, edge; edges)
	{
		if (edge.length == 1)
		{
			nodes ~= [cast(long)i, edge[0][1]];
			nodes ~= [edge[0][0], 0];
			pos = edge[0][0];
			break;
		}
	}

	while (true)
	{
		if (edges[pos].length == 1)
		{
			break;
		}
		foreach (edge; edges[pos])
		{
			if (nodes[$-2][0] != edge[0])
			{
				nodes[$-1][1] = edge[1];
				nodes ~= [edge[0], 0];
				pos = edge[0];
				break;
			}
		}
	}

	auto ans = new long[](N);
	ans[nodes[0][0]] = 0;
	long d = nodes[0][1];
	foreach (node; nodes[1..$])
	{
		if (d % 2 == 0)
			ans[node[0]] = 0;
		else
			ans[node[0]] = 1;
		d += node[1];
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush();
	debug readln();
}