/*------------------------------------------------------------------*/
/*------------------------- begin template -------------------------*/
/*------------------------------------------------------------------*/

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

macro_rules! input_inner {
    ($parser:ident) => {};
    ($parser:ident, ) => {};
    ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($parser, $t);
        input_inner!{$parser $($r)*}
    };
}

macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, char_) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()[0]
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

use std::io;
use std::io::BufRead;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
    pub reader: R,
    buf: Vec<u8>,
    pos: usize,
}

impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
    pub fn fast_i64(&mut self) -> i64 {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            if begin == self.buf.len() {
                self.update_buf();
                continue;
            }
            let mut res = 0;
            let (is_positive, mut end) = match self.buf[begin] {
                b'+' => (true, begin + 1),
                b'-' => (false, begin + 1),
                _ => (true, begin),
            };
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                res = res * 10 + (self.buf[end] as i64 - '0' as i64);
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return if is_positive { res } else { -res };
            } else {
                self.update_buf();
            }
        }
    }
}

#[allow(unused_imports)]
use std::cmp::*;
pub struct WeightedGraph<W> {
    n: usize,
    edges: Vec<Vec<(usize, W)>>,
}

impl<W: Clone + Copy> WeightedGraph<W> {
    pub fn new(n: usize) -> WeightedGraph<W> {
        WeightedGraph::<W> {
            n: n,
            edges: vec![vec![]; n],
        }
    }
    fn add_edge(&mut self, s: usize, t: usize, w: W) {
        self.edges[s].push((t, w));
    }
    pub fn v(&self) -> usize {
        self.n
    }
    pub fn new_from_undirected_weighted_edges(
        n: usize,
        xs: &Vec<(usize, usize, W)>,
    ) -> WeightedGraph<W> {
        let mut res = WeightedGraph::<W>::new(n);
        for &(s, t, w) in xs.iter() {
            res.add_edge(s, t, w);
            res.add_edge(t, s, w);
        }
        res
    }
    pub fn new_from_directed_weighted_edges(
        n: usize,
        xs: &Vec<(usize, usize, W)>,
    ) -> WeightedGraph<W> {
        let mut res = WeightedGraph::<W>::new(n);
        for &(s, t, w) in xs.iter() {
            res.add_edge(s, t, w);
        }
        res
    }
}

use std::ops::*;
impl<W> Index<usize> for WeightedGraph<W> {
    type Output = Vec<(usize, W)>;
    fn index(&self, i: usize) -> &Vec<(usize, W)> {
        &self.edges[i]
    }
}

use std::collections::BinaryHeap;

pub fn dijkstra<W: Clone + Copy + Ord + Neg<Output = W> + Add<Output = W>>(
    graph: &WeightedGraph<W>,
    s: usize,
    zero: W,
) -> Vec<Option<W>> {
    let mut res = vec![None; graph.v()];
    let mut heap = BinaryHeap::<(W, usize)>::new();
    res[s] = Some(zero);
    heap.push((-zero, s));
    while let Some((neg_d, v)) = heap.pop() {
        let d = -neg_d;
        for &(next, w) in graph[v].iter() {
            let nd = d + w;
            if res[next].is_none() || res[next].unwrap() > nd {
                res[next] = Some(nd);
                heap.push((-nd, next));
            }
        }
    }
    res
}

fn main() {
    input! {
        new_stdin_parser = parser,
    }
    let res = solve(&mut parser);
    print!("{}", res);
}

/*------------------------------------------------------------------*/
/*-------------------------- end template --------------------------*/
/*------------------------------------------------------------------*/

use std::fmt::Write;
fn solve<R: BufRead>(parser: &mut Parser<R>) -> String {
    let mut buf = String::new();
    input! {
        parser = parser,
        n: usize,
        m: usize,
        s: usize1,
        t: usize1,
        xs: [(usize1, usize1, i64, i64); m],
    }
    let graph1 = WeightedGraph::new_from_undirected_weighted_edges(
        n,
        &xs.iter().map(|x| (x.0, x.1, x.2)).collect(),
    );
    let dists1 = dijkstra(&graph1, s, 0);
    let graph2 = WeightedGraph::new_from_undirected_weighted_edges(
        n,
        &xs.iter().map(|x| (x.0, x.1, x.3)).collect(),
    );
    let dists2 = dijkstra(&graph2, t, 0);
    let inf = 1i64 << 60;
    let mut res = vec![inf; n];
    res[n - 1] = dists1[n - 1].unwrap() + dists2[n - 1].unwrap();
    for i in (0..n - 1).rev() {
        let t = dists1[i].unwrap() + dists2[i].unwrap();
        res[i] = min(t, res[i + 1]);
    }
    for &r in &res {
        writeln!(buf, "{}", 10i64.pow(15) - r);
    }
    buf
}


Measured memory_bytes: 39164