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: inpl = lambda: list(map(int, input().split()))
  
  
  class ParityTree:
      def __init__(self, N):
          self.parent = [-1] * int(N)
          self.parity = [0] * int(N)
  
      def root(self, n):
          if self.parent[n] < 0:
              return n, 0
          else:
              m, p = self.root(self.parent[n])
              self.parent[n] = m
              self.parity[n] = (p + self.parity[n]) % 2
              return m, self.parity[n]
  
      def merge(self, m, n, parity):
          rm, pm = self.root(m)
          rn, pn = self.root(n)
          if rm != rn:
              if -self.parent[rm] < -self.parent[rn]:
                  rm, rn = rn, rm
              self.parent[rm] += self.parent[rn]
              self.parent[rn] = rm
              self.parity[rn] = (pm + pn + parity) % 2
  
      def size(self, n):
          return -self.parent[self.root(n)]
  
      def aresame(self, m, n):
          return self.root(m) == self.root(n)
  
  
  N = int(input())
  pt = ParityTree(N)
  for i in range(N - 1):
      u, v, w = inpl()
      pt.merge(u - 1, v - 1, w)
  
  for i in range(N):
      print(pt.root(i)[1])
  
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"}]