#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<assert.h>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353 
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
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 T >
struct edge {
  int src, to;
  T cost;
 
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
 
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
 
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
 
  operator int() const { return to; }
};
 
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
 

 
vector<int> dijkstra(WeightedGraph<int> &G,int s)
{ 
  
  vector<int> path(G.size(),I64_MAX);
  path[s] = 0;
  priority_queue <pair<int,int> ,vector<pair<int,int> > ,greater<pair<int,int> > > que;
 
  que.emplace(path[s],s);
 
  while(!que.empty())
  {
    int cost;
    int idx;
    tie(cost,idx) = que.top();
    que.pop();
 
    if(path[idx] < cost) continue;
    for (auto &e: G[idx])
    {
      int next_cost = cost + e.cost;
      if(path[e.to] <= next_cost) continue;
      path[e.to] = next_cost;
      que.emplace(path[e.to],e.to);
    }
  }
 
  return path;
}
 

//一点更新RQM用テンプレート
// auto fx = [](int x1, int x2) -> int { return min(x1, x2); };
// int ex = numeric_limits<int>::max();
// SegTree<int> rmq(n, fx, ex);

template <typename X>
struct SegTree {
    using FX = function<X(X, X)>; // X•X -> X となる関数の型
    int n;
    FX fx;
    const X ex;
    vector<X> dat;
    SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {
        int x = 1;
        while (n_ > x) {
            x *= 2;
        }
        n = x;
    }
 
    void set(int i, X x) { dat[i + n - 1] = x; }
    void build() {
        for (int k = n - 2; k >= 0; k--) dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
    }
 
    void update(int i, X x) {
        i += n - 1;
        dat[i] = x;
        while (i > 0) {
            i = (i - 1) / 2;  // parent
            dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);
        }
    }
 
    X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
    X query_sub(int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) {
            return ex;
        } else if (a <= l && r <= b) {
            return dat[k];
        } else {
            X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
            X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
            return fx(vl, vr);
        }
    }
};


void solve(void)
{
  int N,M,S,T;
  cin>>N>>M>>S>>T;
  S--;T--;
  WeightedGraph<int> WG1(N);
  WeightedGraph<int> WG2(N);
  for (int i = 0; i < M; i++)
  {
    int A,B,C,D;
    cin>>A>>B>>C>>D;
    A--;B--;
    WG1[A].emplace_back(A,B,C);
    WG1[B].emplace_back(B,A,C);

    WG2[A].emplace_back(A,B,D);
    WG2[B].emplace_back(B,A,D);
  }
  auto path1 = dijkstra(WG1,S);
  auto path2 = dijkstra(WG2,T);
  //一点更新RQM用テンプレート
  auto fx = [](int x1, int x2) -> int { return min(x1, x2); };
  int ex = numeric_limits<int>::max();
  SegTree<int> rmq(N, fx, ex);
  for (int i = 0; i < N; i++)
  {
    rmq.set(i,path1[i]+path2[i]);
    // DEBUG(path1[i]+path2[i],"\n");
  }
  rmq.build();
  for (int i = 0; i < N; i++)
  {
    
    cout<<(int)1e15 - rmq.query(i,N)<<endl;;
  }
  
  
  return;
}
int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}


Measured memory_bytes: 25608