{-# LANGUAGE BangPatterns #-}
import Control.Monad
import Data.Maybe
import Debug.Trace
import Data.List
import qualified Data.Map.Strict as Map
import qualified Data.IntMap.Strict as IntMap
import qualified Data.Set as Set
import qualified Data.IntSet as IntSet
import Data.Functor
import Data.Array
-- import Data.Array.Unboxed
import Control.Monad.ST
import Data.Array.ST

main :: IO ()
main = do
  n <- readLn :: IO Int
  uvws <- replicateM (n-1) $ map read . words <$> getLine :: IO [[Int]]
  putStr . unlines . map show $ solve' n uvws

solve' :: Int -> [[Int]] -> [Int]
solve' n uvws = map color $ map (flip ufFind uf) [1..n]
  where
    initial = ufFromList [1..n]
    uf = foldl' (\tree (u:v:w:_) -> if even w then ufUnite u v tree else tree) initial uvws
    zeroRoot = go uvws
    go [] = 1
    go ((u:v:w:_):uvwss)
      | even w = ufFind u uf
      | otherwise = go uvwss
    color i = if ufFind i uf == zeroRoot
              then 0
              else 1


type UnionFind = (IntMap.IntMap Int, IntMap.IntMap Int)

ufFromList :: [Int] -> UnionFind
ufFromList as = (IntMap.fromList $ zip as as, IntMap.fromList $ zip as (repeat 1))

ufIsRoot :: Int -> UnionFind -> Bool
ufIsRoot k uf = k == ((fst uf) IntMap.! k)

ufFind :: Int -> UnionFind -> Int
ufFind k uf | ufIsRoot k uf = k
            | otherwise = ufFind ((fst uf) IntMap.! k) uf

ufSize :: Int -> UnionFind -> Int
ufSize k uf = let p = ufFind k uf in (snd uf) IntMap.! p

ufUnite :: Int -> Int -> UnionFind -> UnionFind
ufUnite k l uf 
  | (ufFind k uf) == (ufFind l uf) = uf
  | otherwise = if nk < nl 
                then (IntMap.adjust (\_->pl) pk $ fst uf, IntMap.adjust (\_->nk+nl) pl $ snd uf)
                else (IntMap.adjust (\_->pk) pl $ fst uf, IntMap.adjust (\_->nk+nl) pk $ snd uf)
    where
      pk = ufFind k uf
      nk = ufSize k uf
      pl = ufFind l uf
      nl = ufSize l uf
