#include <bits/stdc++.h>
#include <cstring>
#include <cstdio>
#pragma GCC optimize ("O3")
#define din cin
#define dout out
#define pi 3.14159265359
#define sw(x,y) x^=y,y^=x,x^=y
#define bmin(a,b)((a<b)?(a):(b))
#define bmax(a,b)((a>b)?(a):(b))
#define bminify(a,b)a=bmin(a,b)
#define bmaxify(a,b)a=bmax(a,b)
#define forq(i,ii,n)for(i=ii;i<n;i++)
#define f first
#define s second
#define mod 1000000007ll
#define nmax 300002
#define lim 351
using namespace std;
typedef long long ll;
ifstream in("fmcm.in");
ofstream out("fmcm.out");
//FILE *fin=fopen("infasuratoare.in","r");
//FILE *fout=fopen("infasuratoare.out","w");
int n,m,s2,s1,c0[lim][lim],c1[lim][lim],d[lim],e[lim],c[lim*lim],v[lim][lim],i,j,k,l,u,f[lim],s;
vector<int>g[lim];
int main()
{
in>>n>>m>>s1>>s2;
while(m--)in>>i>>j,in>>v[i][j]>>c0[i][j],c0[j][i]=-c0[i][j],g[i].emplace_back(j),g[j].emplace_back(i);
fill(d,d+lim,INT_MAX);c[0]=s1,l=1,d[s1]=0;
while(l){
    i=c[0]&511,j=c[0]>>9;
    pop_heap(c,c+l,greater<int>()),l--;
    if(d[i]==j){
        for(auto j:g[i])
            if(v[i][j]&&d[i]+c0[i][j]<d[j])
                d[j]=d[i]+c0[i][j],c[l++]=j+d[j]*512,push_heap(c,c+l,greater<int>());
    }
}
for(i=1;i<=n;i++)for(auto j:g[i])c1[i][j]=d[i]+c0[i][j]-d[j];
while(true){
    fill(d,d+lim,INT_MAX),fill(e,e+lim,INT_MAX);
    c[0]=s1,l=1,d[s1]=e[s1]=0,f[s2]=0;
    while(l){
        i=c[0]&511,j=c[0]>>9;
        pop_heap(c,c+l,greater<int>()),l--;
        if(d[i]==j){
            for(auto j:g[i])
                if(v[i][j]&&d[i]+c1[i][j]<d[j])
                    f[j]=i,e[j]=e[i]+c0[i][j],d[j]=d[i]+c1[i][j],c[l++]=j+d[j]*512,push_heap(c,c+l,greater<int>());
        }
    }
    if(f[s2]){
        k=INT_MAX;
        for(i=s2;i!=s1;i=f[i])bminify(k,v[f[i]][i]);
        for(i=s2;i!=s1;i=f[i])v[f[i]][i]-=k,v[i][f[i]]+=k;
        s+=k*e[s2];
        for(i=1;i<=n;i++)for(auto j:g[i])c1[i][j]=e[i]+c0[i][j]-e[j];
    }
    else break;
}
out<<s;
}