#include <bits/stdc++.h>

using namespace std;
ifstream fin("fmcm.in");
ofstream fout("fmcm.out");
typedef pair<int,int> pii;
int n,m,S,D,Fans,Fcost;
int cap[355][355],cost[355][355];
vector<int> muchii[355];
int dist[355],from[355];
priority_queue<pii,vector<pii>,greater<pii>> pq;
bool flux()
{
    for(int i=1;i<=n;i++)
    {
        dist[i]=1e9;
        from[i]=0;
    }
    dist[S]=0;
    pq.push({dist[S],S});
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        for(int i:muchii[nod])
            if(cap[nod][i]>0&&dist[i]>dist[nod]+cost[nod][i])
            {
                dist[i]=dist[nod]+cost[nod][i];
                from[i]=nod;
                pq.push({dist[i],i});
            }
    }
    if(dist[D]==1e9)
        return 0;
    int minim=1e9;
    for(int x=D;x!=S;x=from[x])
        minim=min(minim,cap[from[x]][x]);
    Fans+=minim;
    Fcost+=dist[D]*minim;
    for(int x=D;x!=S;x=from[x])
    {
        cap[from[x]][x]-=minim;
        cap[x][from[x]]+=minim;
    }
    return 1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m>>S>>D;
    for(int i=1;i<=m;i++)
    {
        int a,b,c,z;
        fin>>a>>b>>c>>z;
        cap[a][b]=c;
        cost[a][b]=z;
        cost[b][a]=-z;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    while(flux());
    fout<<Fcost;
    return 0;
}