#include <bits/stdc++.h>

using namespace std;

#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 61)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)

constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template <class T>
string to_string(T s);
template <class S, class T>
string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }

template <class T>
string to_string(T v) {
  if (v.empty()) return "{}";
  string ret = "{";
  for (auto x : v) ret += to_string(x) + ",";
  ret.back() = '}';
  return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
  return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}

void debug() { cerr << endl; }
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
  cerr << to_string(head) << " ";
  debug(tail...);
}

struct IO {
#ifdef _WIN32
  inline char getchar_unlocked() { return getchar(); }
  inline void putchar_unlocked(char c) { putchar(c); }
#endif
  string separator = " ";
  template <class T>
  inline void read(T& x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c != '-' && (c < '0' || '9' < c));
    bool minus = 0;
    if (c == '-') {
      minus = 1;
      c = getchar_unlocked();
    }
    x = 0;
    while ('0' <= c && c <= '9') {
      x *= 10;
      x += c - '0';
      c = getchar_unlocked();
    }
    if (minus) x = -x;
  }
  inline void read(string& x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c == ' ' || c == '\n');
    x.clear();
    do {
      x += c;
      c = getchar_unlocked();
    } while (c != ' ' && c != '\n' && c != EOF);
  }
  template <class T>
  inline void read(vector<T>& v) {
    for (auto& x : v) read(x);
  }
  template <class Head, class... Tail>
  inline void read(Head& head, Tail&... tail) {
    read(head);
    read(tail...);
  }
  template <class T>
  inline void write(T x) {
    char buf[32];
    int p = 0;
    if (x < 0) {
      x = -x;
      putchar_unlocked('-');
    }
    if (x == 0) putchar_unlocked('0');
    while (x > 0) {
      buf[p++] = (x % 10) + '0';
      x /= 10;
    }
    while (p) {
      putchar_unlocked(buf[--p]);
    }
  }
  inline void write(string x) {
    for (char c : x) putchar_unlocked(c);
  }
  inline void write(const char s[]) {
    for (int i = 0; s[i] != 0; ++i) putchar_unlocked(s[i]);
  }
  template <class T>
  inline void write(vector<T> v) {
    for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
      write(*itr);
      write(separator);
    }
    write(v.back());
  }
  template <class Head, class... Tail>
  inline void write(Head head, Tail... tail) {
    write(head);
    write(separator);
    write(tail...);
  }
  template <class Head, class... Tail>
  inline void writeln(Head head, Tail... tail) {
    write(head, tail...);
    write("\n");
  }
  void set_separator(string s) { separator = s; }
} io;

int main() {
  ll n, m, s, t;
  io.read(n, m, s, t);
  vector<vector<Pll>> Ga(n), Gb(n);
  REP(i, m) {
    ll u, v, a, b;
    io.read(u, v, a, b);
    Ga[u - 1].emplace_back(a, v - 1);
    Ga[v - 1].emplace_back(a, u - 1);
    Gb[u - 1].emplace_back(b, v - 1);
    Gb[v - 1].emplace_back(b, u - 1);
  }
  vector<ll> dista(n, LLINF), distb(n, LLINF);
  priority_queue<Pll, vector<Pll>, greater<Pll>> q;
  q.push(Pll(0, s - 1));
  while (!q.empty()) {
    ll d = q.top().first, u = q.top().second;
    q.pop();
    if (dista[u] <= d) continue;
    dista[u] = d;
    for (auto p : Ga[u]) {
      if (dista[p.second] > dista[u] + p.first) {
        q.push(Pll(dista[u] + p.first, p.second));
      }
    }
  }
  q.push(Pll(0, t - 1));
  while (!q.empty()) {
    ll d = q.top().first, u = q.top().second;
    q.pop();
    if (distb[u] <= d) continue;
    distb[u] = d;
    for (auto p : Gb[u]) {
      if (distb[p.second] > distb[u] + p.first) {
        q.push(Pll(distb[u] + p.first, p.second));
      }
    }
  }
  vector<ll> ans(n + 1);
  ans[n] = LLINF;
  for (int i = n - 1; i >= 0; --i)
    ans[i] = min(ans[i + 1], dista[i] + distb[i]);
  REP(i, n) io.writeln((ll)1e15 - ans[i]);
  return 0;
}

Measured memory_bytes: 19576