#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;


typedef struct{
  int to;
  long long cost;
}edge;
 
 //distance from s
//O(E log V)
template<class T = int>
void dijkstra(vector<vector<edge> > &G, vector<T> &dist, int s, const T INF = 1ll<<50){
  
  //first : distance from s, second : its vertex
  priority_queue< pair<T, int> , vector<pair<T, int> >, greater< pair<T, int> > > pq;
   
  fill(dist.begin(), dist.end(), INF);
  dist[s] = 0;
  pq.push( {dist[s], s} );

  while(!pq.empty()){
    auto q = pq.top();
    pq.pop();
    int from = q.second;
    if(dist[from] < q.first) continue; // it's not minimum distance

    for(auto& e: G[from]){
      if(dist[e.to] > dist[from] + e.cost){
        dist[e.to] = dist[from] + e.cost;
        pq.push( make_pair(dist[e.to], e.to) );
      }
    }
  }
}
 
void add_edge(vector<vector<edge> > &G, int from, int to, long long cost){
  G[from].push_back( (edge){to, cost} );
  //G[to].push_back( (edge){from, cost} );
}
 

template<class T=int>
class SparseTable{
 public:
  SparseTable(int len, T default_value_ = 100000000, function<T(T,T)> eval = default_evaluate)
   : col(len), default_value(default_value_) 
  {
    evaluate = eval;
    row = 1;
    while((1<<row) < col) row += 1;
    row++;
    table = vector<vector<T>>(row, vector<T>(col, default_value));
  }

  SparseTable(vector<T>& vec, T default_value_ = 100000000, function<T(T,T)> eval = default_evaluate)
   : col(vec.size()), default_value(default_value_)
  {
    evaluate = eval;

    row = 1;
    while((1<<row) < col) row += 1;
    row++;
    table = vector<vector<T>>(row, vector<T>(col, default_value));

    set(vec);
  }

  void set(vector<T>& vec){
    assert(col == vec.size());

    values = &vec;
    vector<T>& val = vec;

    iota(table[0].begin(), table[0].end(), 0);
    for(int k=1; k<row; k++){
      for(int i=0; i + (1<<k)-1 < col; i++){
        T left = val[table[k-1][i]];
        T right = val[table[k-1][i+(1<<(k-1))]];
        if(left == evaluate(left,right)){
          table[k][i] = table[k-1][i];
        }else{
          table[k][i] = table[k-1][i+(1<<(k-1))];
        }
      }
    }
  }

  //[l,r)
  T get(int l, int r){
    if(l>=r) return default_value;
    vector<T>& val = *values;

    T ret = default_value;

    int k = 0;
    while((1<<(k+1)) < (r-l)) k++;

    T left = val[ table[k][l] ];
    T right = val[ table[k][r-(1<<k)] ];

    ret = evaluate(left, right);
    return ret;
  }

 private:
  int col;
  int row;
  T default_value;
  vector<T>* values;
  vector<vector<T>> table;

  static T default_evaluate(T a, T b){
    return min(a,b);
  }
  function<T(T,T)> evaluate;
};




int main(){
  int n,m,s,t;
  cin >> n,m,s,t;
  s--; t--;
  vector<int> u(m),v(m),a(m),b(m);
  for(int i=0; i<m; i++){
    cin >> u[i],v[i],a[i],b[i];
    u[i]--;
    v[i]--;
  }

  vector<vector<edge>> X(n), Y(n);
  for(int i=0; i<m; i++){
    add_edge(X, u[i],v[i], a[i]);
    add_edge(X, v[i],u[i], a[i]);
    add_edge(Y, u[i],v[i], b[i]);
    add_edge(Y, v[i],u[i], b[i]);
  }

  vector<long long> dX(n), dY(n);
  dijkstra(X, dX, s);
  dijkstra(Y, dY, t);

  
  vector<long long> ans(n);

  for(int i=0; i<n; i++){
    ans[i] = dX[i] + dY[i];
  }

  SparseTable<long long> st(ans, 15_ten);

  for(int i=0; i<n; i++){
    long long a = 15_ten - st.get(i, n);
    println(a);
  }


  return 0;
}


Measured memory_bytes: 35068