import java.util.*;
import java.io.*;

public class Main {
    static boolean[] v = new boolean[1000000];
    static boolean[] color = new boolean[1000000];

    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        // long[][] w = new long[n][n];
        Map<Integer, List<Edge>> w = new HashMap<>();
        // List<Edge> w = new ArrayList<>();
        for (int i = 0; i < n - 1; i++) {
            int u = sc.nextInt() - 1;
            int v = sc.nextInt() - 1;
            long weight = sc.nextLong();
            // w[u][v] = weight;
            // w[v][u] = weight;
            if (!w.containsKey(u)) {
                w.put(u, new ArrayList<>());
            }
            if (!w.containsKey(v)) {
                w.put(v, new ArrayList<>());
            }
            w.get(u).add(new Edge(v, weight));
            w.get(v).add(new Edge(u, weight));
        }
        // System.out.println(Arrays.deepToString(w));
        dfs(0, w);
        for (int i = 0; i < n; i++) {
            if (color[i]) {
                System.out.println("1");
            } else {
                System.out.println("0");
            }
        }
    }

    public static void dfs(int now, Map<Integer, List<Edge>> w) {
        v[now] = true;
        for (Edge e : w.get(now)) {
            if (v[e.to]) {
                continue;
            }
            if (e.cost % 2 == 0) {
                color[e.to] = color[now];
            } else {
                color[e.to] = !color[now];
            }
            dfs(e.to, w);
        }
    }
}

class Edge {
    int to;
    long cost;

    public Edge(int to, long cost) {
        this.to = to;
        this.cost = cost;
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}


Measured memory_bytes: 82048