{-# LANGUAGE BangPatterns #-}
import Control.Arrow
import Control.Monad.Fix
import Data.Foldable
import qualified Data.Vector as V
import qualified Data.Vector.Mutable as VM
import qualified Data.Vector.Unboxed as VU
import qualified Data.Vector.Unboxed.Mutable as VUM
import qualified Data.ByteString.Char8 as B
import Data.ByteString.Internal (accursedUnutterablePerformIO)
import Debug.Trace

uread :: VUM.Unbox a => Int -> VUM.IOVector a -> a
uread !i !v = accursedUnutterablePerformIO $ VUM.unsafeRead v i

uwrite :: VUM.Unbox a => Int -> a -> VUM.IOVector a -> VUM.IOVector a
uwrite !i !a !v =
  accursedUnutterablePerformIO $ VUM.unsafeWrite v i a >> return v

uswap :: VUM.Unbox a => Int -> Int -> VUM.IOVector a -> VUM.IOVector a
uswap !i !j !v =
  accursedUnutterablePerformIO $ VUM.unsafeSwap v i j >> return v

uthaw :: VUM.Unbox a => VU.Vector a -> VUM.IOVector a
uthaw !v = accursedUnutterablePerformIO $ VU.unsafeThaw v

ufreeze :: VUM.Unbox a => VUM.IOVector a -> VU.Vector a
ufreeze !v = accursedUnutterablePerformIO $ VU.unsafeFreeze v

data PQueue a = PQueue !Int !(VUM.IOVector a)

new :: VUM.Unbox a => Int -> PQueue a
new !s = PQueue 0 $ accursedUnutterablePerformIO $ VUM.new (s + 1)

push :: (Ord a, Bounded a) => VUM.Unbox a => a -> PQueue a -> PQueue a
push !a !(PQueue k vec) = PQueue (k + 1) vec'
 where
  vec' = up k a $ uwrite k a $ if VUM.length vec <= k
    then accursedUnutterablePerformIO $ VUM.unsafeGrow vec (VUM.length vec * 2)
    else vec

  up !i !cv !vec = (\(_, v) -> v) $ fix
    ( \f (!ci, !vec) ->
      let pi = (ci - 1) `div` 2
          pv = if 0 < ci then uread pi vec else minBound
      in  if 0 < ci && cv < pv
            then let vec' = uswap pi ci vec in vec' `seq` f (pi, vec')
            else (ci, vec)
    )
    (i, vec)

popMin :: (Ord a, Bounded a, VUM.Unbox a) => PQueue a -> Maybe (a, PQueue a)
popMin !(PQueue k vec) | k <= 0    = Nothing
                       | otherwise = Just (uread 0 vec, PQueue (k - 1) vec')
 where
  vec' = let v = uswap (k - 1) 0 vec in v `seq` down 0 (uread 0 vec) v

  down !i !cv !vec = (\(_, v) -> v) $ fix
    ( \f (!ci, !vec) ->
      let li = ci * 2 + 1
          lv = if li < k - 1 then uread li vec else maxBound
          ri = ci * 2 + 2
          rv = if ri < k - 1 then uread ri vec else maxBound
      in  if cv <= lv && cv <= rv
            then (ci, vec)
            else
              let p    = if lv > rv then ri else li
                  vec' = uswap p ci vec
              in  vec' `seq` f (p, vec')
    )
    (i, vec)

popMin' :: (Ord a, Bounded a, VUM.Unbox a) => PQueue a -> (a, PQueue a)
popMin' !pq = maybe (error "size < 0") id $ popMin pq

umodifyV :: Int -> (a -> a) -> VM.IOVector a -> VM.IOVector a
umodifyV !i !f !v = accursedUnutterablePerformIO $ VM.modify v f i >> return v

uthawV :: V.Vector a -> VM.IOVector a
uthawV !v = accursedUnutterablePerformIO $ V.thaw v

ufreezeV :: VM.IOVector a -> V.Vector a
ufreezeV !v = accursedUnutterablePerformIO $ V.freeze v

dijkstra
  :: Int  -- ^ nodes
  -> V.Vector (VU.Vector (Int, Int))  -- ^ edges from i-th node: (end, cost)
  -> Int  -- ^ start node
  -> Int  -- ^ end node
  -> VU.Vector Int  -- ^ constructed graph
dijkstra !n !edges !s !t = ufreeze $ snd $ fix
  ( \f (!nodes, !costs) -> case popMin nodes of
    Nothing              -> (nodes, costs)
    Just ((c, n), nodes) -> if c <= uread n costs
      then
        let es = edges V.! n
        in  f $ VU.foldl'
              ( \(!ns, !cs) (!e, !ec) ->
                let c' = c + ec
                in  if c' < uread e costs
                      then (push (c', e) ns, uwrite e c' cs)
                      else (ns, cs)
              )
              (nodes, costs)
              es
      else f (nodes, costs)
  )
  (nodes0, costs0)
 where
  costs0 :: VUM.IOVector Int
  costs0 = uwrite s 0 $ uthaw $ VU.replicate n maxBound

  nodes0 :: PQueue (Int, Int)
  nodes0 = push (0, s) $ new 0

solve :: Int -> Int -> Int -> Int -> VU.Vector (Int, Int, Int, Int) -> [Int]
solve !n !m !s !t !trains = map (10 ^ 15 -) $ fst $ foldl'
  (\(!acc, !prev) !i -> let cur = calcCost i `min` prev in (cur : acc, cur))
  ([], 10 ^ 15 :: Int)
  [n - 1, n - 2 .. 0]
 where
  yenGraph = dijkstra
    n
    ( V.map (\(!v) -> VU.fromList v) $ ufreezeV $ VU.foldl'
      (\gr (u, v, a, b) -> umodifyV v ((u, a) :) $ umodifyV u ((v, a) :) $ gr)
      (uthawV $ V.replicate n [])
      trains
    )
    s
    t
  snookGraph = dijkstra
    n
    ( V.map (\(!v) -> VU.fromList v) $ ufreezeV $ VU.foldl'
      (\gr (u, v, a, b) -> umodifyV v ((u, b) :) $ umodifyV u ((v, b) :) $ gr)
      (uthawV $ V.replicate n [])
      trains
    )
    t
    s

  calcCost i = yenGraph VU.! i + snookGraph VU.! i

main = do
  let readInt = fmap (second B.tail) . B.readInt

  (n, m, s, t) <-
    (\vec -> (vec VU.! 0, vec VU.! 1, vec VU.! 2 - 1, vec VU.! 3 - 1))
    .   VU.unfoldrN 4 readInt
    <$> B.getLine
  uvab <-
    VU.replicateM m
    $   (\vec -> (vec VU.! 0 - 1, vec VU.! 1 - 1, vec VU.! 2, vec VU.! 3))
    .   VU.unfoldrN 4 readInt
    <$> B.getLine
  mapM_ print $ solve n m s t uvab


Measured memory_bytes: 79996