#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#define bFor(i,a,b) for(i=a;i>=b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;

long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}

double dist(ddatas& x,ddatas& y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

ll modncr(ll n,ll r){
  ll i,plus=1;
  rep(i,r){
    plus=(plus*(n-i))%mod;
    plus=moddevide(plus,i+1);
  }
  return plus;
}

ll modncrlistp[200000],modncrlistm[200000];

ll modncrs(ll n,ll r){
  ll i,j;
  if(modncrlistp[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistp[i])break;
    }
    if(i<0){
      modncrlistp[0]=1;
      rep1(i,n+1){
        modncrlistp[i]=(modncrlistp[i-1]*i)%mod;
      }
    }else{
      For(j,i+1,n+1){
        modncrlistp[j]=(modncrlistp[j-1]*j)%mod;
      }
    }
  }
  if(modncrlistm[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistm[i])break;
    }
    if(i<0){
      modncrlistm[0]=1;
      rep1(i,n+1){
        modncrlistm[i]=(modncrlistm[i-1]*modinv(i))%mod;
      }
    }else{
      For(j,i+1,n+1)modncrlistm[j]=(modncrlistm[j-1]*modinv(j))%mod;
    }
  }
  return (((modncrlistp[n]*modncrlistm[r])%mod)*modncrlistm[n-r])%mod;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

vec eratosthenes(ll N){
  ll i;
  vec ch(N+1,1),p;
  ch[0]=ch[1]=0;
  rep(i,N+1){
    if(ch[i]){
      p.push_back(i);
      for(ll j=2;i*j<=N;j++){
        ch[i*j]=0;
      }
    }
  }
  return ch;
}
int main(){
  ll i,N,M,s,g,a,b,c,e,cnt=1;
  cin>>N>>M>>s>>g;
  s--;g--;
  vector<vector<tdata>> v(N);
  vec ans(N,inf),d(N,inf);
  ans[s]=0;d[g]=0;
  rep(i,M){
    cin>>a>>b>>c>>e;
    a--;b--;
    v[a].push_back(tdata(b,datas(c,e)));
    v[b].push_back(tdata(a,datas(c,e)));
  }

  priority_queue<datas,pvec,greater<datas>> que;
  for(auto i:v[s]){
    que.push(datas(i.second.first,i.first));
  }
  while(!que.empty()){
    auto x=que.top();que.pop();
    if(ans[x.second]!=inf)continue;
    ans[x.second]=x.first;
    for(auto i:v[x.second]){
      if(ans[i.first]!=inf)continue;
      ll next=x.first+i.second.first;
      que.push(datas(next,i.first));
    }
  }
  for(auto i:v[g]){
    que.push(datas(i.second.second,i.first));
  }
  while(cnt<N){
    auto x=que.top();que.pop();
    if(d[x.second]!=inf)continue;
    d[x.second]=x.first;
    cnt++;
    for(auto i:v[x.second]){
      if(d[i.first]!=inf)continue;
      ll next=x.first+i.second.second;
      que.push(datas(next,i.first));
    }
  }
  rep(i,N)ans[i]+=d[i];
  brep(i,N-1){
    ans[i]=min(ans[i],ans[i+1]);
  }
  M=pow(10,15);
  rep(i,N)cout<<M-ans[i]<<endl;
  return 0;
}

Measured memory_bytes: 12792