output_description: 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.
  
  * * *
input_description: 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}
attempt: # AtCoder Beginner Contest 126
  # https://atcoder.jp/contests/abc126
  import sys
  
  # import numpy as np
  
  s2nn = lambda s: [int(c) for c in s.split(" ")]
  ss2nn = lambda ss: [int(s) for s in ss]
  ss2nnn = lambda ss: [s2nn(s) for s in ss]
  i2s = lambda: sys.stdin.readline().rstrip()
  i2n = lambda: int(i2s())
  i2nn = lambda: s2nn(i2s())
  ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
  ii2nn = lambda n: ss2nn(ii2ss(n))
  ii2nnn = lambda n: ss2nnn(ii2ss(n))
  
  
  def main():
      N = i2n()
      uvw = ii2nnn(N - 1)
      d = [[] for _ in range(N)]
      for u, v, w in uvw:
          b = w % 2 == 0
          d[u - 1].append((v - 1, b))
          d[v - 1].append((u - 1, b))
      nn = [-1 for _ in range(N)]
      nn[0] = 0
  
      def main2(src):
          links = d[src]
          c = nn[src]
          for dst, b in links:
              if nn[dst] == -1:
                  nn[dst] = c if b else 1 - c
                  main2(dst)
  
      main2(0)
      for n in nn:
          print(n)
  
  
  main()
  
problem_description: 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.
samples: [{"input": "3\n    1 2 2\n    2 3 1", "output": "0\n    0\n    1\n    \n\n* * *"}, {"input": "5\n    2 5 2\n    2 3 10\n    1 3 8\n    3 4 2", "output": "1\n    0\n    1\n    0\n    1"}]