#include<fstream>
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#define vec G[nod][i]
#define cost COST[nod][vec]
#define NMAX 355
#define DIJKSTRA_TYPE pair<int,short> 
#define LL long long
using namespace std;
FILE *fin;
short n,source,destination;
int DIST[NMAX],FLUX[NMAX][NMAX],CAPACITY[NMAX][NMAX],COST[NMAX][NMAX],INF=(1<<30);
long long VOLMIN,sol,D;
short TT[NMAX];
vector<short> G[NMAX];
bool use[NMAX];
queue<int> Q;
priority_queue<DIJKSTRA_TYPE, vector<DIJKSTRA_TYPE>, greater<DIJKSTRA_TYPE> > HEAP;
inline LL min(LL a, int b)
{
	if(a<b)
		return a;
	return b;
}
void init()
{
	for(short i=1;i<=n;i++)
		DIST[i]=INF;
}
void read()
{
	fin=fopen("fmcm.in","r");
	short m,z,c;
	fscanf(fin,"%hd %hd %hd %hd",&n,&m,&source,&destination);
	short x,y;
	while(m--)
	{
		fscanf(fin,"%hd %hd %hd %hd",&x,&y,&z,&c);
		G[x].push_back(y);
		G[y].push_back(x);
		CAPACITY[x][y]=z;
		COST[x][y]=c;
		COST[y][x]=-c;
	}
	fclose(fin);
}
void print()
{
	ofstream fout("fmcm.out");
	fout<<sol<<'\n';
	fout.close();
}
void bellman_ford()
{
	short nod;
	init();
	DIST[source]=0;
	Q.push(source);
	use[source]=1;
	while(!Q.empty())
	{
		nod=Q.front();
		Q.pop();
		use[nod]=0;
		for(size_t i=0;i<G[nod].size();i++)
			if(CAPACITY[nod][vec]>FLUX[nod][vec] && DIST[nod]+cost<DIST[vec])
			{
				DIST[vec]=DIST[nod]+cost;
				if(!use[vec])
				{
					use[vec]=1;
					Q.push(vec);
				}
			}
	}
}
void flux_update()
{
	short i;
	VOLMIN=INF;
	for(i=destination;i!=source;i=TT[i])
		VOLMIN=min(VOLMIN,CAPACITY[TT[i]][i]-FLUX[TT[i]][i]);
	for(i=destination;i!=source;i=TT[i])
	{
		FLUX[TT[i]][i]+=VOLMIN;
		FLUX[i][TT[i]]-=VOLMIN;
	}
	D+=DIST[destination];
	sol+=(VOLMIN*D);
}
void DIJKSTRA_INIT()
{
	for(short nod=1;nod<=n;nod++)
        for(size_t i=0;i<G[nod].size();i++)
        	if (DIST[nod]!=INF && DIST[vec]!=INF)
                cost+=(DIST[nod]-DIST[vec]);
	init();
}
bool dijkstra()
{
	DIJKSTRA_INIT();
	DIST[source]=0;
	HEAP.push(make_pair(0,source));
	short nod;
	while(!HEAP.empty())
	{
		nod=HEAP.top().second;
		if(DIST[nod]!=HEAP.top().first)
		{
			HEAP.pop();
			continue;
		}
		HEAP.pop();
		for(size_t i=0;i<G[nod].size();i++)
			if(CAPACITY[nod][vec]>FLUX[nod][vec] && DIST[nod]+cost<DIST[vec])
			{
				DIST[vec]=DIST[nod]+cost;
				TT[vec]=nod;
				HEAP.push(make_pair(DIST[vec],vec));
			}
	}
	return (DIST[destination]<INF);
}
int main()
{
	read();
	bellman_ford();
	D=DIST[destination];
	while(dijkstra())
		flux_update();
	print();
	return 0;
}