using System;
using System.Collections.Generic;
using System.Linq;
using Graph = System.Collections.Generic.List<System.Collections.Generic.List<System.Tuple<int, int>>>;

namespace AtCoder.Problems
{
    public class ProblemA
    {
        public static void Main(string[] args)
        {
            var s = new SolveA();
            s.Solve();
        }

        public class Scanner
        {
            private string[] _s;
            private int _i;
            private readonly char[] _separators = new char[] { ' ' };

            public Scanner()
            {
                _s = new string[0];
                _i = 0;
            }

            public string Next()
            {
                if (_i < _s.Length) return _s[_i++];
                string st = Console.ReadLine();
                while (st == "") st = Console.ReadLine();
                _s = st.Split(_separators, StringSplitOptions.RemoveEmptyEntries);
                if (_s.Length == 0) return Next();
                _i = 0;
                return _s[_i++];
            }

            public int NextInt() => int.Parse(Next());
            public long NextLong() => long.Parse(Next());
            public ulong NextULong() => ulong.Parse(Next());
            public double NextDouble() => double.Parse(Next());

            public int[] GetIntArray(int n, int add = 0)
            {
                int[] array = new int[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextInt() + add;
                }
                return array;
            }

            public long[] GetLongArray(int n, long add = 0)
            {
                long[] array = new long[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextLong() + add;
                }
                return array;
            }

            public double[] GetDoubleArray(int n, double add = 0)
            {
                double[] array = new double[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextDouble() + add;
                }
                return array;
            }
        }
    }

    public class SolveA
    {
        public void Solve()
        {
            var cin = new ProblemA.Scanner();

            var n = cin.NextInt();

            var G = new Graph(n + 1);
            for (int i = 0; i < n + 1; i++) { G.Add(new List<Tuple<int, int>>()); }

            for (int i = 0; i < n - 1; i++)
            {
                var a = cin.NextInt();
                var b = cin.NextInt();
                var distance = cin.NextInt();
                G[a].Add(new Tuple<int, int>(b, distance));
                G[b].Add(new Tuple<int, int>(a, distance));
            }

            var result = GetAnswer(G, n);
            Console.WriteLine(result);
        }

        public string GetAnswer(Graph G, int n)
        {
            var color = new int[n + 1];
            for (int i = 0; i < color.Length; i++) { color[i] = -1; }

            color[1] = 0;
            dfs(G, color, 1);

            return string.Join("\n", color.Skip(1).Select(c => c.ToString()));
        }

        private void dfs(Graph G, int[] color, int v)
        {
            foreach (var next in G[v])
            {
                if (color[next.Item1] != -1) { continue; }
                color[next.Item1] = color[v] == 0 ? next.Item2 % 2 : (next.Item2 + 1) % 2;
                dfs(G, color, next.Item1);
            }
        }
    }
}


Measured memory_bytes: 38824