#include<cstdio>
#define N 351
int c[N][N],n,m,t[N],i,j,k,l,b[N],s,d,a[N],g[N][N],o[N][N];

int A()
{int Q[N],p,q,i;
bool u[N];
for(i=1;i<=n;i++)
    b[i]=N,u[i]=0;
u[s]=1,Q[0]=s,p=q=b[s]=t[d]=0;
while(p<=q&&!t[d])
    {i=Q[p++];
    for(k=0;k<a[i];k++)
    if(!u[g[i][k]]&&c[i][g[i][k]]>0&&b[g[i][k]]>b[i]+o[i][g[i][k]])
          u[g[i][k]]=1,Q[++q]=g[i][k],t[g[i][k]]=i,b[g[i][k]]=b[i]+o[i][g[i][k]];}
return t[d]!=0;}

void B()
{int e=0,j,k;
while(A())
    for(k=0;k<a[d];k++) 
    if(t[g[d][k]]) 
          {m=10001;
          for(j=g[d][k];t[j];j=t[j])
          if(m>c[t[j]][j])
               m=c[t[j]][j];
          if(m>c[g[d][k]][d])
               m=c[g[d][k]][d];
          if(m<=0) 
               continue;
          c[g[d][k]][d]-=m,c[d][g[d][k]]+=m;
          for(j=g[d][k];t[j];j=t[j])
               c[t[j]][j]-=m,c[j][t[j]]+=m;
          e=e+m*b[d];}
printf("%d\n",e);}

int main()
{freopen("maxflow.in","r",stdin);
freopen("maxflow.out","w",stdout);
scanf("%d%d",&n,&m);
freopen("fmcm.in","r",stdin);
freopen("fmcm.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&s,&d);
while(m--)
          scanf("%d%d%d%d",&i,&j,&l,&k),g[i][a[i]++]=j,g[j][a[j]++]=i,o[i][j]=k,o[j][i]=-k,c[i][j]=l;
B();
return 0;}