using System;
using System.IO;
using System.Text;
using System.Collections;
using System.Collections.Generic;
class abc126_d {
    static int __cnt = 0;
    static string __mark = "###";
    static void Main(string[] args) {
#if LOCAL_ENVIRONMENT
        StreamReader __sr = new StreamReader("stdin.txt");
        string __str = __sr.ReadToEnd();
        __sr.Close();
        int __index = __str.IndexOf(__mark, 0);
        while (__index != -1) {
            __index = __str.IndexOf(__mark, __index + __mark.Length);
            __cnt++;
        }
        if (__cnt > 0) {
            Console.Write("Eenter test data no(1-{0})? ", __cnt);
            Console.Out.Flush();
            if (!int.TryParse(Console.ReadLine(), out __cnt)) __cnt = 1;
            Console.WriteLine("Select/Default test data: {0}", __cnt);
        }
        var stdin = new System.IO.StreamReader("stdin.txt");
        Console.SetIn(stdin);
#endif
        SimpleScanner sc = new SimpleScanner(__cnt);
        int N = sc.NextInt();
        var graph = new List<Item>[N];
        for (var n = 0; n < N; n++) graph[n] = new List<Item>();
        for (var n = 0; n < N-1; n++) {
            int u = sc.NextInt() - 1, v = sc.NextInt() - 1, w = sc.NextInt() % 2;
            graph[u].Add(new Item(v, w));
            graph[v].Add(new Item(u, w));
        }
        var ans = new int[N]; 
        ans[0] = 0; for (var n = 1; n < N; n++) ans[n] = -1;
        var q = new Queue<int>();
        q.Enqueue(0);
        while (q.Count > 0) {
            int v = q.Dequeue();
            foreach (var item in graph[v]) {
                int u = item.to, cost = item.cost;
                if (ans[u] == -1) {
                    ans[u] = ans[v] ^ cost;
                    q.Enqueue(u);
                }
            }
        }
        foreach (var a in ans) Console.WriteLine(a);
    } //Main

    public class Item {
        public int to { get; set; }
        public int cost { get; set; }
        public Item(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
        public override string ToString() {
            return $"[to:{this.to}, cost:{this.cost}]";
        }
    }
    public class SimpleScanner {
        private int cnt;
        private string[] items;
        public SimpleScanner(int cnt = 0) {
            this.cnt = 0;
            var sb = new StringBuilder();
            var s = Console.ReadLine();
            while (s != null) {
                sb.Append(s + " ");
                s = Console.ReadLine();
            }
            this.items = sb.ToString().Split(' ');
#if LOCAL_ENVIRONMENT
            if (cnt > 0) {
                int index = Array.IndexOf(this.items, __mark + cnt.ToString());
                this.cnt = index + 1;
            }
            Console.Error.WriteLine("SimpleScanner.cnt: {0}", this.cnt);
            Console.Error.WriteLine("SimpleScanner.items: {0}" , this.items.ToStringA());
#endif
        }
        public void SetCnt(int n) { this.cnt = n; }
        public int NextInt() {
            return int.Parse(this.items[this.cnt++]);
        }
        public long NextLong() {
            return long.Parse(this.items[this.cnt++]);
        }
        public string NextString() {
            return this.items[this.cnt++];
        }
        public int[] NextIntArray(int n) {
            if (n < 1) throw new IndexOutOfRangeException("引数は1以上であること！");
            var result = new int[n];
            for (var i = 0; i < n; i++) result[i] = this.NextInt();
#if LOCAL_ENVIRONMENT
            Console.Error.WriteLine("{0}", result.ToStringA());
#endif
            return result;
        }
        public long[] NextLongArray(int n) {
            if (n < 1) throw new IndexOutOfRangeException("引数は1以上であること！");
            var result = new long[n];
            for (var i = 0; i < n; i++) result[i] = this.NextLong();
#if LOCAL_ENVIRONMENT
            Console.Error.WriteLine("{0}", result.ToStringA());
#endif
            return result;
        }
        public string[] NextStringArray(int n) {
            if (n < 1) throw new IndexOutOfRangeException("引数は1以上であること！");
            var result = new string[n];
            for (var i = 0; i < n; i++) result[i] = this.NextString();
#if LOCAL_ENVIRONMENT
            Console.Error.WriteLine("{0}", result.ToStringA());
#endif
            return result;
        }
        public int[][] NextInt2Col(int n) {
            const int M = 2;
            if (n < 1) throw new IndexOutOfRangeException("引数は1以上であること！");
            int[][] result = new int[M][] {
                new int[n],
                new int[n],
            };
            for (var i = 0; i < n; i++) {
                result[0][i] = this.NextInt();
                result[1][i] = this.NextInt();
            }
#if LOCAL_ENVIRONMENT
            Console.Error.WriteLine("NextInt2Col: [");
            for (var i = 0; i < M; i++)
                Console.Error.WriteLine("  {0},", result[i].ToStringA());
            Console.Error.WriteLine("]");
#endif
            return result;
        }
    }
}
static class Extensions {
    public static bool IsEven(this int value) {
        return value % 2 == 0;
    }
    public static bool IsOdd(this int value) {
        return value % 2 != 0;
    }
    public static string ToStringA<T>(this T[] array, string separator = ", ", string braces = "[]") {
        string bL = braces.Length > 0 ? braces[0].ToString() : "";
        string bR = braces.Length > 1 ? braces[1].ToString() : "";
        return bL + String.Join(separator, array) + bR;
    }
    public static T Max<T>(this T[] array) where T: IComparable { // this->params
        if(array.Length < 1) throw new IndexOutOfRangeException("要素は1つ以上であること！");
        T max = array[0];
        for(int i = 1; i < array.Length; i++) {
            max = max.CompareTo(array[i]) > 0 ? max : array[i];
        }
        return max;
    }
    public static T Min<T>(this T[] array) where T: IComparable {
        if(array.Length < 1) throw new IndexOutOfRangeException("要素は1つ以上であること！");
        T min = array[0];
        for(int i = 1; i < array.Length; i++) {
            min = min.CompareTo(array[i]) < 0 ? min : array[i];
        }
        return min;
    }
    public static T[] SortDesc<T>(this T[] array) {
        Array.Sort(array);
        Array.Reverse(array);
        return array;
    }
}


Measured memory_bytes: 52272