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 Haskell (GHC 7.10.3) (judge verdict: Wrong Answer)

import           Control.Monad
import           Data.Array.IO
import           Data.Bits
import qualified Data.ByteString.Char8       as BS
import           Data.Char
import           Data.Maybe
import qualified Data.Vector.Unboxed         as V
import qualified Data.Vector.Unboxed.Mutable as VM
import           System.IO

readInt = fst . fromJust . BS.readInt
readIntList = map readInt . BS.words
getInt = readInt <$> BS.getLine
getIntList = readIntList <$> BS.getLine

getEdges evenEs oddEs = do
  [u, v, w] <- getIntList
  let evenEs' = if w `mod` 2 == 0 then (u, v) : evenEs else evenEs
      oddEs' = if w `mod` 2 == 0 then oddEs else (u, v) : oddEs
  eof <- isEOF
  if eof
    then return (evenEs', oddEs')
    else getEdges evenEs' oddEs'

main = do
  n <- getInt
  (evenEs, oddEs) <- getEdges [] []

  cs <- VM.new n
  VM.set cs (-1 :: Int)

  forM_ oddEs $ \(u, v) -> do
    ucol <- VM.read cs (u-1)
    vcol <- VM.read cs (v-1)
    let (ucol', vcol') = newCols ucol vcol 1
    VM.write cs (u-1) ucol'
    VM.write cs (v-1) vcol'

  forM_ evenEs $ \(u, v) -> do
    ucol <- VM.read cs (u-1)
    vcol <- VM.read cs (v-1)
    let (ucol', vcol') = newCols ucol vcol 0
    VM.write cs (u-1) ucol'
    VM.write cs (v-1) vcol'

  forM_ [0..(n-1)] $ \i -> do
    c <- VM.read cs i
    print c

newCols (-1) (-1) 0 = (0, 0)
newCols (-1) (-1) 1 = (0, 1)
newCols (-1) vcol 0 = (vcol, vcol)
newCols (-1) vcol 1 = ((vcol+1) .&. 1, vcol)
newCols ucol (-1) 0 = (ucol, ucol)
newCols ucol (-1) 1 = (ucol, (ucol+1) .&. 1)
newCols ucol vcol _ = (ucol, vcol)