Problem:
Score : 400 points

Problem Statement

We have a tree with N vertices numbered 1 to N.
The i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.
Your objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:

For any two vertices painted in the same color, the distance between them is an even number.

Find a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

1 \leq u_i < v_i \leq N

1 \leq w_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
u_1 v_1 w_1
u_2 v_2 w_2
.
.
.
u_{N - 1} v_{N - 1} w_{N - 1}

Output

Print a coloring of the vertices that satisfies the condition, in N lines.
The i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.

If there are multiple colorings that satisfy the condition, any of them will be accepted.

Sample Input 1

3
1 2 2
2 3 1

Sample Output 1

0
0
1

Sample Input 2

5
2 5 2
2 3 10
1 3 8
3 4 2

Sample Output 2

1
0
1
0
1

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCorder
{
	public class Program
	{
		static List<Tuple<int, int>>[] tos;
		static int[] ans;
		static bool[] done;

		static void Main(string[] args)
		{
			Scanner cin = new Scanner();
			int n = cin.Int();
			tos = new List<Tuple<int, int>>[n];
			for (int i = 0; i < n; i++) {
				tos[i] = new List<Tuple<int, int>>();
			}

			for (int i = 0; i < n - 1; i++) {
				int u = cin.Int() - 1;
				int v = cin.Int() - 1;
				int w = cin.Int();
				tos[u].Add(new Tuple<int, int>(v, w));
				tos[v].Add(new Tuple<int, int>(u, w));
			}

			ans = new int[n];
			done = new bool[n];
			ans[0] = 0;

			Dfs(0);

			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < n; i++) {
				sb.AppendLine(ans[i].ToString());
			}

			Console.WriteLine(sb.ToString());
		}

		static void Dfs(int nn)
		{
			if (done[nn]) {
				return;
			}

			done[nn] = true;
			foreach (var to in tos[nn]) {
				if ((ans[nn] == 0 && (to.Item2 % 2 == 0))
					|| ans[nn] == 1 && (to.Item2 % 2 == 1)) {
					ans[to.Item1] = 0;
				} else {
					ans[to.Item1] = 1;
				}

				Dfs(to.Item1);
			}
		}
	}

	public class Scanner
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private string[] buf_;
		private int index_;
		
		public Scanner()
		{
			buf_ = new string[0];
			index_ = 0;
		}

		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = Console.ReadLine();
			while (st == "") {
				st = Console.ReadLine();
			}

			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int()
		{
			return int.Parse(Next());
		}
		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}

		public long Long()
		{
			return long.Parse(Next());
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}

		public double Double()
		{
			return double.Parse(Next());
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}
	}
}