// Flux maxim de cost minim - O(N*M^2*LogN)
// Bellman + Dijkstra
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define Nmax 355
#define oo 2000000000
#define pb push_back
#define x first
#define y second
using namespace std;
ifstream f("fmcm.in");
ofstream g("fmcm.out");

int N,M,Source,Sink,x,y,c,z,MaxFlow,CostMin;
int cap[Nmax][Nmax],cost[Nmax][Nmax],flow[Nmax][Nmax],ante[Nmax],d[Nmax],old_d[Nmax],real_d[Nmax];
vector < int > G[Nmax];

queue < int > Q;
bitset < Nmax> inQ;

typedef pair<int,int> PP;
priority_queue < PP  , vector < PP > , greater<PP> > pq;


int Bellman(int Source)
{
    for(int i=1;i<=N;++i)old_d[i]=oo;
    old_d[Source]=0 , inQ[Source]=1;
    for(Q.push(Source); !Q.empty();Q.pop())
    {
        int node=Q.front();
        inQ[node]=0;
        for(vector<int>::iterator it=G[node].begin();it!=G[node].end();++it)
            if(d[*it]>d[node]+cost[node][*it] && flow[node][*it]<cap[node][*it])
            {
                old_d[*it]=old_d[node]+cost[node][*it];
                if(!inQ[*it])Q.push(*it) , inQ[*it]=1;
            }
    }
}

int Dijkstra(int Source)
{
    for(int i=1;i<=N;++i)d[i]=oo,ante[i]=oo;
    d[Source]=0 , ante[Source]=Source;
    for(pq.push(PP(0,Source)); !pq.empty();)
    {
        int  val=pq.top().x,node=pq.top().y;
        pq.pop();
        if(d[node]<val)continue;
        for(vector<int>::iterator it=G[node].begin();it!=G[node].end();++it)
            if(flow[node][*it]<cap[node][*it])
            {
                int aux=d[node]+cost[node][*it]+old_d[node]-old_d[*it];
                if(aux<d[*it])
                {
                    d[*it]=aux , ante[*it] = node;
                    real_d[*it]=real_d[node]+cost[node][*it];
                    pq.push( PP(d[*it] , *it) );
                }
            }
    }
    for(int i=1;i<=N;++i)old_d[i]=real_d[i];
    return (d[Sink]!=oo) ;
}

void GetFMCM()
{
    for( ; Dijkstra(Source) ; )
    {
        int MinFlow=oo;
        for(int i=Sink; i!=Source ; i=ante[i])
            MinFlow=min(MinFlow,cap[ante[i]][i]-flow[ante[i]][i]);
        if(MinFlow)
        {
            for(int i=Sink; i!=Source ; i=ante[i])
            {
                flow[ante[i]][i]+=MinFlow;
                flow[i][ante[i]]-=MinFlow;
            }
            CostMin+=MinFlow*real_d[Sink]; //MaxFlow+=MinFlow;
        }
    }
    g<<CostMin<<'\n';
}

int main()
{
    f>>N>>M>>Source>>Sink;
    for(int i=1;i<=M;++i)
        {
            f>>x>>y>>c>>z;
            G[x].pb(y) , G[y].pb(x);
            cap[x][y]=c;
            cost[x][y]=z , cost[y][x]=-z;
        }
    GetFMCM();
    f.close();g.close();
    return 0;
}