{-# 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 = go initial
  -- IntMap.elems . foldl' f initial
  where
    initial = IntMap.adjust (\_->Black) 1 $ ufFromList [1..n]
    go uf [] = map toInt $ IntMap.elems uf
    go uf ((u:v:w:_):uvws) = if ufFind u uf == Yet && ufFind v uf == Yet
      then go uf (uvws++[[u,v,w]])
      else if even w then go (ufSameColor u v uf) uvws
                     else go (ufDifferentColor u v uf) uvws


-- Disjoint Set
data Color = Black | White | Yet
    deriving (Show, Eq)
another Yet = Yet
another Black = White
another White = Black
toInt Black = 0
toInt White = 1

type UnionFind = IntMap.IntMap Color

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

ufFind :: Int -> UnionFind -> Color
ufFind k uf = uf IntMap.! k

ufColor :: (Color -> Color) -> Int -> Int -> UnionFind -> UnionFind
ufColor color x y uf 
  | cx == Yet = IntMap.adjust (\_ -> color cy) x uf
  | cy == Yet = IntMap.adjust (\_ -> color cx) y uf
  | otherwise = uf
    where
      cx = ufFind x uf
      cy = ufFind y uf

ufSameColor = ufColor id
ufDifferentColor = ufColor another

-- ufIsSameGroup :: (Ord a) =>  a -> a -> UnionFind a -> Bool
-- ufIsSameGroup i j uf = ufFind j uf == ufFind j uf
