#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <typename T>
struct SegmentTree {
  using F = function<T(T, T)>;
  vector<T> v;
  F f;
  T e;
  int n;
  SegmentTree(int size, F f, T e) : f(f), e(e) {
    n = 1;
    while (n < size) n <<= 1;
    v.resize(n * 2, e);
  }
  void set(int k, T x) {
    v[k + n] = x;
  }
  void build() {
    for (int i = n - 1; i > 0; i--) {
      v[i] = f(v[i * 2 + 0], v[i * 2 + 1]);
    }
  }
  void update(int k, T x) {
    v[k += n] = x;
    while (k >>= 1) v[k] = f(v[k * 2 + 0], v[k * 2 + 1]);
  }
  T query(int a, int b) {
    T l = e, r = e;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) l = f(l, v[a++]);
      if (b & 1) r = f(v[--b], r);
    }
    return f(l, r);
  }
};

using P = pair<int, int>;

vector<i64> dijkstra(vector<vector<P>> &g, int s) {
  vector<i64> dist(g.size(), (i64) 1e18);
  pqasc<pair<i64, int>> q;
  q.emplace(0, s);
  dist[s] = 0;
  while (q.size()) {
    i64 d; int u;
    tie(d, u) = q.top(), q.pop();
    if (dist[u] < d) continue;
    for (auto p : g[u]) {
      int v, c;
      tie(v, c) = p;
      if (dist[v] <= d + c) {
        continue;
      }
      dist[v] = d + c;
      q.emplace(d + c, v);
    }
  }
  return dist;
}

void solve() {
  int n, m, s, t;
  cin >> n >> m >> s >> t;
  s--, t--;
  vector<vector<P>> ga(n);
  vector<vector<P>> gb(n);
  SegmentTree<i64> st(n, [](i64 a, i64 b) { return min(a, b); }, (i64) 1e18);
  rep(i, m) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    ga[u].emplace_back(v, a);
    ga[v].emplace_back(u, a);
    gb[u].emplace_back(v, b);
    gb[v].emplace_back(u, b);
  }
  auto as = dijkstra(ga, s);
  auto bs = dijkstra(gb, t);
  rep(i, n) {
    st.set(i, as[i] + bs[i]);
  }
  st.build();
  rep(i, n) {
    i64 ans = 1e15 - st.query(0, n);
    cout << ans << endl;
    st.update(i, (i64) 1e18);
  }
}


Measured memory_bytes: 17528