using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using static System.Math;

class Solver {
    Scanner sc = new Scanner();

    public void Solve() {
        var N = sc.nextInt();
        var U = new int[N-1];
        var V = new int[N- 1];
        var w = new int[N- 1];
        var M = new List<Pair>[N];
        for (int i = 0; i < N; i++) {
            M[i] = new List<Pair>();
        }
        for (int i = 0; i < N - 1; i++) {
            U[i] = sc.nextInt();
            V[i] = sc.nextInt();
            w[i] = sc.nextInt();
            M[U[i] - 1].Add(new Pair(w[i], V[i] - 1));
            M[V[i] - 1].Add(new Pair(w[i], U[i] - 1));
        }

        var d = Dijkstra(N, M);

        for (int i = 0; i < N; i++) {
            if (d[i] % 2 == 0) {
                WriteLine('0');
            } else {
                WriteLine('1');
            }
        }
    }

    int[] Dijkstra(int vertex, List<Pair>[] adjacency) {
        var s = 0;
        var dist = new bool[vertex];
        var d = new int[vertex];
        for (int i = 0; i < vertex; i++) {
            d[i] = int.MaxValue;
        }
        d[s] = 0;

        var PQ = new PriorityQueue(vertex);

        PQ.Push(new Pair(0, s));

        while (!PQ.IsEmpty()) {
            var f = PQ.Pop();
            var u = f.Value;
            dist[u] = true;

            if (d[u] < f.Key) { continue; }

            for (int i = 0; i < adjacency[u].Count; i++) {
                int v = adjacency[u][i].Value;
                if (dist[v]) { continue; }
                if (d[u] + adjacency[u][i].Key < d[v]) {
                    d[v] = d[u] + adjacency[u][i].Key;
                    PQ.Push(new Pair(d[v], v));
                }
            }
        }
        return d;
    }

    class Pair {
        public int Key { get; set; }
        public int Value { get; set; }

        public Pair(int key, int value) {
            Key = key;
            Value = value;
        }
    }

    class PriorityQueue {
        Pair[] A;
        int _cnt = 0;
        bool _asc;

        public PriorityQueue(int n, bool asc = true) {
            A = new Pair[500001];
            _asc = asc;
        }

        public void Push(Pair pair) {
            _cnt++;
            A[_cnt] = new Pair(int.MinValue, 0);
            HeapIncreaseKey(_cnt, pair);
        }

        public Pair Pop() {
            if (_cnt < 1) { return null; }
            var pop = A[1];
            A[1] = A[_cnt];
            A[_cnt] = null;
            _cnt--;
            Heapify(1);
            return pop;
        }

        public bool IsEmpty() {
            return _cnt == 0;
        }

        void HeapIncreaseKey(int i, Pair pair) {
            if (pair.Key <= A[i].Key) { return; }
            A[i] = pair;

            while (i > 1 && Compare(A[Parent(i)].Key, A[i].Key)) {
                Swap(Parent(i), i);
                i = Parent(i);
            }
        }

        bool Compare(int l, int r) {
            if (_asc) {
                return l > r;
            } else {
                return l < r;
            }
        }

        void Heapify(int i) {
            var l = i * 2;
            var r = i * 2 + 1;
            int largest;

            if (l <= _cnt && Compare(A[i].Key, A[l].Key)) {
                largest = l;
            } else {
                largest = i;
            }

            if (r <= _cnt && Compare(A[largest].Key, A[r].Key)) {
                largest = r;
            }

            if (largest != i) {
                Swap(i, largest);
                Heapify(largest);
            }
        }

        void Swap(int a, int b) {
            var tmp = A[a];
            A[a] = A[b];
            A[b] = tmp;
        }

        static int Parent(int i) { return i / 2; }
    }
}

class Scanner {
    string[] s;
    int i;

    char[] cs = 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(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt() {
        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] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong() {
        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] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble() {
        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] = nextDouble() + add;
        }
        return Array;
    }
}

class Program {
    static void Main(string[] args) {
        Solver s = new Solver();
        s.Solve();
    }
}


Measured memory_bytes: 33896