#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

#define INF 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define sc second
#define fs first
#define DIM 355

vector <pair <int,int> > g[DIM];
int c[DIM][DIM],f[DIM][DIM];
int n,m,SRC,DST,cost;
int dst[DIM],t[DIM];
bool viz[DIM];

struct cmp
{
    bool operator () (const int &a,const int &b)
    {
        return dst[a]>dst[b];
    }
}; priority_queue <int,vector <int>,cmp> q;

void read ()
{
    int i,x,y,z,t;

    scanf ("%d%d%d%d",&n,&m,&SRC,&DST);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d%d",&x,&y,&z,&t);
        g[x].pb (mp (y,t));
        g[y].pb (mp (x,-t));
        c[x][y]=z;
    }
}

int dijkstra ()
{
    vector <pair <int,int> > :: iterator it;
    int nod;

    memset (t,0,sizeof (t));
    memset (viz,0,sizeof (viz));
    memset (dst,INF,sizeof (dst));
    dst[SRC]=0;
    for (q.push (SRC); !q.empty (); )
    {
        viz[nod=q.top ()]=0; q.pop ();
        for (it=g[nod].begin (); it!=g[nod].end (); ++it)
            if (dst[nod]+it->sc<dst[it->fs] && c[nod][it->fs]!=f[nod][it->fs])
            {
                dst[it->fs]=dst[nod]+it->sc;
                t[it->fs]=nod;
                if (!viz[it->fs])
                {
                    viz[it->fs]=1;
                    q.push (it->fs);
                }
            }
    }

    return dst[DST]!=INF;
}

void solve ()
{
    vector <int> :: iterator it;
    int i,min_cur;

    for ( ; dijkstra (); )
    {
        min_cur=INF;
        for (i=DST; i!=SRC; i=t[i])
            min_cur=min (min_cur,c[t[i]][i]-f[t[i]][i]);
        for (i=DST; i!=SRC; i=t[i])
        {
            f[t[i]][i]+=min_cur;
            f[i][t[i]]-=min_cur;
        }
        cost+=min_cur*dst[DST];
    }
    printf ("%d",cost);
}

int main ()
{
    freopen ("fmcm.in","r",stdin);
    freopen ("fmcm.out","w",stdout);

    read ();
    solve ();

    return 0;
}