#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <utility>
#include <limits>
#include <list>

/* template start */
 
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out(){std::cerr<<std::endl;}

template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
  std::cerr<<" "<<h;
  if(sizeof...(t)>0)std::cout<<" :";
  debug_out(t...);
}
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}

template<typename Num>
constexpr Num mypow(Num a, long long b) {
  if(b==0)return 1;
  if (a==0)return 0;
  Num x = 1;
  while (b > 0) {
    if(b & 1)x*=a;
    a*=a;
    b >>= 1;
  }
  return x;
}

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr bool operator==(const modint rhs) const noexcept {return a==rhs.a;}
  constexpr bool operator!=(const modint rhs) const noexcept {return !(*this==rhs);}
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

/* template end */

using ll = long long;

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n,m,s,t;
  std::cin>>n>>m>>s>>t;
  s--;t--;

  using P=std::pair<ll,ll>;

  std::vector<std::vector<P>> yen(n),snuke(n);

  rep(i,0,m){
    ll u,v,a,b;
    std::cin>>u>>v>>a>>b;
    u--;v--;
    yen[u].emplace_back(v,a);
    yen[v].emplace_back(u,a);
    snuke[u].emplace_back(v,b);
    snuke[v].emplace_back(u,b);
  }

  constexpr ll INF=1e15;

  std::vector<ll> d_yen(n,INF),d_snuke(n,INF);

  std::priority_queue<P,std::vector<P>,std::greater<P>> que;

  d_yen[s]=0;
  que.emplace(0,s);
  while(!que.empty()){
    auto now=que.top();que.pop();
    if(d_yen[now.second]<now.first)continue;

    for(const auto& e:yen[now.second]){
      if(d_yen[e.first] > d_yen[now.second] + e.second){
        d_yen[e.first]=d_yen[now.second]+e.second;
        que.emplace(d_yen[e.first],e.first);
      }
    }
  }

  debug(d_yen);

  d_snuke[t]=0;
  que.emplace(0,t);
  while(!que.empty()){
    auto now=que.top();que.pop();
    if(d_snuke[now.second]<now.first)continue;

    for(const auto& e:snuke[now.second]){
      if(d_snuke[e.first] > d_snuke[now.second] + e.second){
        d_snuke[e.first]=d_snuke[now.second]+e.second;
        que.emplace(d_snuke[e.first],e.first);
      }
    }
  }

  debug(d_snuke);

  std::vector<ll> ans(n);

  ll min=INF;

  for(ll i=n-1;i>=0;i--){
    chmin(min,d_yen[i]+d_snuke[i]);
    ans[i]=INF-min;
  }

  for(const auto& e:ans)std::cout<<e<<"\n";


  return 0;
}

Measured memory_bytes: 19576