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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Objects;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Ribhav
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DEvenRelation solver = new DEvenRelation();
        solver.solve(1, in, out);
        out.close();
    }

    static class DEvenRelation {
        public void solve(int testNumber, FastReader s, PrintWriter out) {
            int n = s.nextInt();
            HashMap<Integer, ArrayList<DEvenRelation.pair>> map = new HashMap<>();
            for (int i = 0; i < n - 1; i++) {
                int from = s.nextInt();
                int to = s.nextInt();
                int wt = s.nextInt();
                ArrayList<DEvenRelation.pair> list = map.getOrDefault(from, new ArrayList<>());
                list.add(new DEvenRelation.pair(to, wt));
                map.put(from, list);
                list = map.getOrDefault(to, new ArrayList<>());
                list.add(new DEvenRelation.pair(from, wt));
                map.put(to, list);
            }

            HashSet<Integer> blacks = new HashSet<>();
            HashSet<Integer> whites = new HashSet<>();
            boolean[] visited = new boolean[n];
            whites.add(1);
            dfs(1, visited, blacks, whites, map);
            StringBuilder ans = new StringBuilder();
            for (int i = 1; i <= n; i++) {
                if (whites.contains(i)) {
                    ans.append("0\n");
                } else {
                    ans.append("1\n");
                }
            }
            out.println(ans);
//        out.println(blacks);
        }

        private void dfs(int num, boolean[] visited, HashSet<Integer> blacks, HashSet<Integer> whites, HashMap<Integer, ArrayList<DEvenRelation.pair>> map) {
            visited[num - 1] = true;
            ArrayList<DEvenRelation.pair> list = map.get(num);
            for (DEvenRelation.pair p : list) {
                if (!visited[p.dest - 1]) {
                    if (p.weight % 2 == 0) {
                        if (blacks.contains(num)) {
                            blacks.add(p.dest);
                        } else {
                            whites.add(p.dest);
                        }
                    } else {
                        if (blacks.contains(num)) {
                            whites.add(p.dest);
                        } else {
                            blacks.add(p.dest);
                        }
                    }
                    dfs(p.dest, visited, blacks, whites, map);
                }
            }
        }

        private static class pair {
            int dest;
            int weight;

            public pair(int dest, int weight) {
                this.dest = dest;
                this.weight = weight;
            }

            public boolean equals(Object o) {
                if (this == o) return true;
                if (!(o instanceof DEvenRelation.pair)) return false;
                DEvenRelation.pair pair = (DEvenRelation.pair) o;
                return dest == pair.dest &&
                        weight == pair.weight;
            }

            public int hashCode() {
                return Objects.hash(dest, weight);
            }

            public String toString() {
                final StringBuilder sb = new StringBuilder("pair{");
                sb.append("dest=").append(dest);
                sb.append(", weight=").append(weight);
                sb.append('}');
                return sb.toString();
            }

        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}