#include<stdio.h>
#include<vector>
#include<set>
#include<queue>
#define inf 2000000000
using namespace std;
FILE*f=fopen("fmcm.in","r");
FILE*g=fopen("fmcm.out","w");
int nr,x,y,z,T,n,m,k,d[351],nod,c[351][351],F[351][351],sol,minn,S,D,tt[351],s[351],dist[352];
char viz[351];
vector <pair<int,int> > v[351];
int t[351],p[352];
queue<int> q;
set<pair<int,int> >::iterator it;
void up(int x)
{
	int k=d[x];
	int pk=p[x];
	while(x>1&&k<d[x/2])
	{
		d[x]=d[x/2];
		p[x]=p[x/2];
		t[p[x]]=x;
		x/=2;
	}
	d[x]=k;
	p[x]=pk;
	t[p[x]]=x;
	
}
void down(int x)
{
	int k=d[x];
	int pk=p[x];
	int ok=1;
	while(ok&&x<=nr)
	{
		int son=0;
		if(2*x<=nr)
			son=2*x;
		if(2*x+1<=nr&&d[2*x+1]<d[2*x])
			son=2*x+1;
		if(d[son]>=k||!son)
			ok=0;
		else
		{
			d[x]=d[son];
			p[x]=p[son];
			t[p[x]]=x;
			x=son;
		}			
	
	}
	d[x]=k;
	p[x]=pk;
	t[p[x]]=x;
		
}
int dijkstra()
{
	int k;
	int min=inf;
	if(nr)
	{
		min=d[1];
		dist[p[1]]=d[1];
		k=p[1];
		d[1]=d[nr];
		p[1]=p[nr];
		--nr;
		down(1);
	}
	
	if(min!=inf)
	{
		viz[k]=1;
		for(int i=0;i<v[k].size();++i)
			if(!viz[v[k][i].first])
				if(d[t[v[k][i].first]]>min+v[k][i].second&&c[k][v[k][i].first]>F[k][v[k][i].first])
				{
					d[t[v[k][i].first]]=min+v[k][i].second;
					tt[v[k][i].first]=k;
					up(t[v[k][i].first]);
				}
		dijkstra();		
	}
	if(dist[D]==inf)
		return 0;
	return 1;
	
}
void update()
{
	for(int i=1;i<=n;++i)
		for(int j=0;j<v[i].size();++j)
			v[i][j].second+=dist[i]-dist[v[i][j].first];
	
}
int main()
{
	fscanf(f,"%d%d%d%d",&n,&m,&S,&D);
	for(int i=1;i<=m;++i)
	{
		fscanf(f,"%d%d%d%d",&x,&y,&z,&T);
		v[x].push_back (make_pair(y,T));
		v[y].push_back (make_pair(x,-T));
		c[x][y]=z;
	}
	
	for(int i=1;i<=n;++i)
		dist[i]=inf;
	dist[S]=0;
	q.push (S);
	viz[S]=1;
	k=1;
	
	while(k&&q.size())
	{
		nod=q.front();
		for(int i=0;i<v[nod].size();++i)
			if(dist[v[nod][i].first]>dist[nod]+v[nod][i].second&&c[nod][v[nod][i].first]-F[nod][v[nod][i].first]>0)
			{
				if(!viz[v[nod][i].first])
				{
					q.push (v[nod][i].first);
					tt[v[nod][i].first]=nod;
					viz[v[nod][i].first]=1;
				}
				dist[v[nod][i].first]=dist[nod]+v[nod][i].second;
				s[v[nod][i].first]++;
				if(s[v[nod][i].first]==n)
				{
					k=0;
					break;
				}
			}
		viz[nod]=0;
		q.pop();
	}
	update();
	int last=dist[D];
	for(int i=1;i<=n;++i)
	{
		d[i]=dist[i]=inf;
		viz[i]=0;
		p[i]=t[i]=i;
	}
	d[S]=0;
	nr=n;
	up(S);
	
	
	
	while(dijkstra())
	{
		minn=inf;
		for(int nod=D;nod!=S;nod=tt[nod])
			if(minn>c[tt[nod]][nod]-F[tt[nod]][nod])
				minn=c[tt[nod]][nod]-F[tt[nod]][nod];
		for(int nod=D;nod!=S;nod=tt[nod])
		{
			F[tt[nod]][nod]+=minn;
			F[nod][tt[nod]]-=minn;
		}
		
		sol+=dist[D]*minn+last*minn;
		last+=dist[D];
		update();
		for(int i=1;i<=n;++i)
		{
			d[i]=dist[i]=inf;
			viz[i]=0;
			p[i]=t[i]=i;
		}
		d[S]=0;
		nr=n;
		up(S);
		
	}
	
	fprintf(g,"%d",sol);
	
	fclose(f);
	fclose(g);
	return 0;
}