#include<fstream>
#include<vector>
#include<queue>
#define vec G[nod][i]
#define cost COST[nod][vec]
#define NMAX 355
#define DIJKSTRA_TYPE pair<int,int> 
using namespace std;
int n,source,destination;
int DIST[NMAX],FLUX[NMAX][NMAX],CAPACITY[NMAX][NMAX],COST[NMAX][NMAX],INF=(1<<30);
int VOLMIN,sol,D;
int TT[NMAX];
vector<int> G[NMAX];
priority_queue<DIJKSTRA_TYPE, vector<DIJKSTRA_TYPE>, greater<DIJKSTRA_TYPE> > HEAP;
void init()
{
	for(int i=1;i<=n;i++)
		DIST[i]=INF;
}
void read()
{
	ifstream fin("fmcm.in");
	int m,z,c;
	fin>>n>>m>>source>>destination;
	int x,y;
	while(m--)
	{
		fin>>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;
	}
	fin.close();
}
void print()
{
	ofstream fout("fmcm.out");
	fout<<sol<<'\n';
	fout.close();
}
void flux_update()
{
	int 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(int 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));
	int 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();
	while(dijkstra())
		flux_update();
	print();
	return 0;
}