#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


template <typename Cost = int> class Edge{
public:
  int from,to;
  Cost cost;
  Edge() {}
  Edge(int to, Cost cost): to(to), cost(cost){}
  Edge(int from, int to, Cost cost): from(from), to(to), cost(cost){}

  Edge rev() const {return Edge(to,from,cost);}
  
  friend ostream& operator<<(ostream &os, const Edge &e){
    os << "(FROM: " << e.from << "," << "TO: " << e.to << "," << "COST: " << e.cost << ")";
    return os;
  }
};

template <typename T> using Graph = vector<vector<Edge<T>>>;
template <typename T> using Tree = vector<vector<Edge<T>>>;

template <typename C, typename T> void add_edge(C &g, int from, int to, T w){
  g[from].push_back(Edge<T>(from, to, w));  
}

template <typename C, typename T> void add_undirected(C &g, int a, int b, T w){
  g[a].push_back(Edge<T>(a, b, w));
  g[b].push_back(Edge<T>(b, a, w));
}


template <typename T>
struct DijkstraResult{
  bool is_infinity;
  T value;
  static auto infinity(){return DijkstraResult({true, 0});}
  static auto make(const T &value){return DijkstraResult({false, value});}
  bool operator==(const DijkstraResult &rhs) const {return is_infinity == rhs.is_infinity and value == rhs.value;}
};

template <typename T, int MOD = 1000000007>
struct Dijkstra{
  using Result = DijkstraResult<T>;
  
  int n;
  std::vector<Result> dist;
  std::vector<int64_t> path_count;
  
  Dijkstra(const Graph<T> &graph, int src):
    n(graph.size()), dist(n, Result::infinity()), path_count(n)
  {
    std::vector<bool> check(n, false);
    std::priority_queue<std::pair<T,int>, std::vector<std::pair<T,int>>, std::greater<std::pair<T,int>>> pq;

    path_count[src] = 1;
    dist[src] = Result::make(0);

    pq.push({0, src});

    while(not pq.empty()){
      int i;
      T d;
      std::tie(d,i) = pq.top(); pq.pop();

      if(check[i]) continue;
      check[i] = true;

      for(auto &e : graph[i]){
        if(dist[e.to].is_infinity){
          dist[e.to] = Result::make(d + e.cost);
          path_count[e.to] = path_count[e.from];
          pq.push({dist[e.to].value, e.to});
        }else{
          if(dist[e.to].value > d + e.cost){
            dist[e.to] = Result::make(d + e.cost);
            path_count[e.to] = path_count[e.from];
            if(not check[e.to]) pq.push({dist[e.to].value, e.to});
          }else if(dist[e.to].value == d + e.cost){
            (path_count[e.to] += path_count[e.from]) %= MOD;
          }
        }
      }
    }
  }
};



int main(){
  int n,m,s,t;
  while(cin >> n >> m >> s >> t){
    --s, --t;
    Graph<LLI> yen_graph(n), snuuk_graph(n);
    REP(i,m){
      int u,v,a,b; cin >> u >> v >> a >> b;
      --u, --v;
      add_undirected(yen_graph, u, v, (LLI)a);
      add_undirected(snuuk_graph, u, v, (LLI)b);
    }

    auto yen = Dijkstra<LLI>(yen_graph, s);
    auto snuuk = Dijkstra<LLI>(snuuk_graph, t);

    vector<LLI> cost(n);
    REP(i,n) cost[i] = yen.dist[i].value + snuuk.dist[i].value;

    vector<LLI> ans(n);
    LLI t = 1e18;
    REV(i,n-1,0){
      chmin(t, cost[i]);
      ans[i] = 1e15-t;
    }

    for(auto a : ans) cout << a << endl;
  }
  
  return 0;
}


Measured memory_bytes: 22852