{-# LANGUAGE BangPatterns, OverloadedStrings #-}
import Control.Arrow
import Control.Monad.Fix
import Data.Foldable
import Data.Monoid
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 qualified Data.ByteString.Builder as B
import qualified Data.ByteString.Lazy as BL
import Data.ByteString.Internal (accursedUnutterablePerformIO)
import qualified System.IO as IO
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

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
  :: (VU.Unbox a, Bounded a, Ord a, Num a)
  => Int  -- ^ nodes
  -> V.Vector [(Int, a)]  -- ^ edges from i-th node: (end, cost)
  -> Int  -- ^ start node
  -> VU.Vector a  -- ^ constructed graph
dijkstra !n !edges !s = ufreeze $ fst $ fix
  ( \f (!costs, !visited) -> case findMinView costs visited of
    (-1) -> (costs, visited)
    n ->
      let
        visited' = uwrite n True visited
        c        = uread n costs
      in
        if c <= uread n costs
          then
            let es = edges V.! n
            in  f
                $  flip (,) visited'
                $! foldl'
                     ( \(!cs) (!e, !ec) ->
                       let c' = c + ec
                       in  c' `seq` if c' < uread e costs
                             then uwrite e c' cs
                             else cs
                     )
                     costs
                     es
          else f (costs, visited')
  )
  (costs0, visited0)
 where
  costs0 :: (VU.Unbox a, Bounded a, Num a) => VUM.IOVector a
  costs0 = uwrite s 0 (uthaw $ VU.replicate n maxBound)

  visited0 :: VUM.IOVector Bool
  visited0 = uthaw $ VU.replicate n False

  findMinView
    :: (VU.Unbox a, Bounded a, Ord a)
    => VUM.IOVector a
    -> VUM.IOVector Bool
    -> Int
  findMinView vec visited =
    fst
      $ foldl'
          ( \(!j, !acc) !i ->
            let a = uread i vec in if a < acc then (i, a) else (j, acc)
          )
          (-1, maxBound)
      $ filter (\(!i) -> uread i visited == False) [0 .. n - 1]

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 `seq` (cur : acc, cur)
  )
  ([], 10 ^ 15 :: Int)
  [n - 1, n - 2 .. 0]
 where
  yenGraph = dijkstra
    n
    ( ufreezeV $ VU.foldl'
      (\gr (u, v, a, b) -> umodifyV v ((u, a) :) $ umodifyV u ((v, a) :) $ gr)
      (uthawV $ V.replicate n [])
      trains
    )
    s
  snookGraph = dijkstra
    n
    ( ufreezeV $ VU.foldl'
      (\gr (u, v, a, b) -> umodifyV v ((u, b) :) $ umodifyV u ((v, b) :) $ gr)
      (uthawV $ V.replicate n [])
      trains
    )
    t

  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

  IO.hSetBinaryMode IO.stdout True
  IO.hSetBuffering  IO.stdout (IO.BlockBuffering Nothing)
  B.hPutBuilder IO.stdout
    $ foldl' (\acc x -> acc <> B.intDec x <> "\n") mempty
    $ solve n m s t uvab

