#include <bits/stdc++.h>
using namespace std;
ifstream in("fmcm.in");
ofstream out("fmcm.out");
const int inf=2e9+7;
vector<int> vec[705];
int cap[705][705];
int cost[705][705];
bool inq[705];
int dists[705];
int dist[705];
int prv[705];
queue<int> q;
set<pair<int,int> > s;
int n,m,st,dr;
int x,y,z,t;
int main()
{
    in>>n>>m>>st>>dr;
    for(int i=1;i<=m;++i)
    {
        in>>x>>y>>z>>t;
        vec[x].push_back(y);
        vec[y].push_back(x);
        cap[x][y]=z;
        cap[y][x]=0;
        cost[x][y]=t;
        cost[y][x]=-t;
    }
    for(int i=1;i<=n;++i)
        dist[i]=inf,inq[i]=false;
    dist[st]=0;
    inq[st]=true;
    q.push(st);
    while(!q.empty())
    {
        int x=q.front(); q.pop();
        inq[x]=false;
        for(int y:vec[x])
        if(dist[y]>dist[x]+cost[x][y] and cap[x][y]>0)
        {
            dist[y]=dist[x]+cost[x][y];
            if(!inq[y])
                inq[y]=true,
                q.push(y);
        }
    }
    for(int x=1;x<=n;++x)
    for(int y:vec[x])
        cost[x][y]+=dist[x]-dist[y];
    int flow=0,price=0;
    do
    {
        for(int i=1;i<=n;++i)
            dists[i]=inf,prv[i]=-1;
        dists[st]=0;
        prv[st]=0;
        s.insert({0,st});
        while(!s.empty())
        {
            int x=(*(s.begin())).second;
            int c=(*(s.begin())).first;
            s.erase(s.begin());
            for(int y:vec[x])
            if(dists[y]>c+cost[x][y] and cap[x][y]>0)
            {
                if(dists[y]!=inf)
                    s.erase(s.find({dists[y],y}));
                prv[y]=x;
                dists[y]=c+cost[x][y];
                s.insert({dists[y],y});
            }
        }
        if(prv[dr]!=-1)
        {
            int el=dr;
            int minim=inf;
            int addons=0;
            while(prv[el]>0)
                minim=min(minim,cap[prv[el]][el]),
                addons+=cost[prv[el]][el],
                el=prv[el];
            flow+=minim;
            price+=minim*(addons-dist[st]+dist[dr]);
            el=dr;
            while(prv[el]>0)
                cap[prv[el]][el]-=minim,
                cap[el][prv[el]]+=minim,
                el=prv[el];
        }
    }while(prv[dr]!=-1);
    //out<<flow<<' '<<price<<'\n';
    out<<price<<'\n';
    return 0;
}