import Data.IntMap ((!))
import qualified Data.IntMap as M
import qualified Data.Set as S
import qualified Data.ByteString.Char8 as B
import Control.Applicative
import Data.Maybe
import Data.List
import Data.Ord

type Weight = Int
type Vertex = Int

type PriorityQueue = S.Set (Weight, Vertex)
nullq = S.null
emp = S.empty 
push c v = S.insert (c,v)
pop = S.deleteFindMin

readEdge = map (fst . fromJust . B.readInt) . B.words

main = do
 (ps:es) <- map (map (fst . fromJust . B.readInt) . B.words) . B.lines <$> B.getContents
 let [nv,ne,v0] = ps
 let ges = groupBy (\e1 e2 -> head e1 == head e2) (sort es)
 let g = M.fromList $ map (\x -> ((head (head x)), map (\[_,t,d]->(t,d)) x)) ges
 let res = sumOfWeight g v0
 mapM_ (putStrLn . maybe "INF" show . flip M.lookup res) [0..nv-1]

sumOfWeight g v0 = dijkstra g im0 q0
 where
  im0 = M.singleton v0 0
  q0 = push 0 v0 emp

dijkstra g im q
 | nullq q = im
 | otherwise = dijkstra g im' q''
 where
  ((d,v),q') = pop q
  im' = foldl' (\acc (b,c) -> M.insert b (d+c) acc) im vns
  q'' = foldl' (\acc (b,c) -> push (d+c) b acc) q' vns
  vns = filter (\(b,c) -> M.notMember b im || d+c < im!b) (M.findWithDefault [] v g)