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: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using BitArray = System.Collections.BitArray;
using BigInteger = System.Numerics.BigInteger;

namespace AtCoderProject
{
    public class Program
    {
        public object Calc()
        {
            //var line = consoleReader.SplitInt();
            var N = consoleReader.Int();
            var chotens = consoleReader.RepeatSplitInt(N - 1).Select(l => new Choten { u = l[0] - 1, v = l[1] - 1, w = l[2] })
                .OrderBy(c => c.u)
                .ThenBy(c => c.v).ToList();
            var res = Enumerable.Repeat<bool?>(null, N).ToArray();
            res[0] = true;

            while (chotens.Count > 0)
            {
                for (int i = 0; i < chotens.Count; i++)
                {
                    var c = chotens[i];

                    if (res[c.u].HasValue)
                        if (c.w % 2 == 0)
                        {
                            res[c.v] = res[c.u];
                        }
                        else
                        {
                            res[c.v] = !res[c.u];
                        }
                    else if (res[c.v].HasValue)
                        if (c.w % 2 == 0)
                        {
                            res[c.u] = res[c.v];
                        }
                        else
                        {
                            res[c.u] = !res[c.v];
                        }
                    else continue;
                    chotens.RemoveAt(i--);
                }
                for (int i = chotens.Count - 1; i >= 0; i--)
                {
                    var c = chotens[i];

                    if (res[c.u].HasValue)
                        if (c.w % 2 == 0)
                        {
                            res[c.v] = res[c.u];
                        }
                        else
                        {
                            res[c.v] = !res[c.u];
                        }
                    else if (res[c.v].HasValue)
                        if (c.w % 2 == 0)
                        {
                            res[c.u] = res[c.v];
                        }
                        else
                        {
                            res[c.u] = !res[c.v];
                        }
                    else continue;
                    chotens.RemoveAt(i);
                }
            }
            return string.Join("\n", res.Select(b => b == true ? 1 : 0));
        }

        struct Choten
        {
            public int u;
            public int v;
            public int w;
        }

        public const int mod = 1000000007;
        #region いつもの
        private readonly ConsoleReader consoleReader;
        public Program() : this(new ConsoleReader()) { }
        public Program(ConsoleReader consoleReader) { this.consoleReader = consoleReader; }
        static void Main() => Console.WriteLine(new Program().Calc());
        public static string MultiLine<T>(IEnumerable<T> source) => string.Join("\n", source);
        #endregion
    }

    #region Console
    public class ConsoleReader { public virtual string String() => Console.ReadLine(); public int Int() => int.Parse(String()); public long Long() => long.Parse(String()); public ulong ULong() => ulong.Parse(String()); public double Double() => double.Parse(String()); public string[] Split() => String().Split().ToArray(); public int[] SplitInt() => String().Split().Select(int.Parse).ToArray(); public long[] SplitLong() => String().Split().Select(long.Parse).ToArray(); public ulong[] SplitULong() => String().Split().Select(ulong.Parse).ToArray(); public double[] SplitDouble() => String().Split().Select(double.Parse).ToArray(); public IEnumerable<string> Repeat(int count) { for (int i = 0; i < count; i++) yield return String(); } public IEnumerable<int> RepeatInt(int count) { for (int i = 0; i < count; i++) yield return Int(); } public IEnumerable<long> RepeatLong(int count) { for (int i = 0; i < count; i++) yield return Long(); } public IEnumerable<string[]> RepeatSplit(int count) { for (int i = 0; i < count; i++) yield return Split(); } public IEnumerable<int[]> RepeatSplitInt(int count) { for (int i = 0; i < count; i++) yield return SplitInt(); } }
    #endregion
}