#include <bits/stdc++.h>

using namespace std;
using pi = pair<int, int>;

int main() {
	ifstream cin("fmcm.in");
	ofstream cout("fmcm.out");
	int n, m, s, t, x, y, z, w;
	cin >> n >> m >> s >> t;
	vector<vector<pi>> G(n + 1);
	vector<vector<int>> c(n + 1, vector<int>(n + 1));
	while (m--) {
		cin >> x >> y >> z >> w;
		G[x].emplace_back(y, w);
		G[y].emplace_back(x, -w);
		c[x][y] = z;
	}
	int flow = 0, cost = 0;
	queue<int> Q;
	vector<int> dd(n + 1, 0x3F3F3F3F), inq(n + 1);
	inq[s] = 1;
	dd[s] = 0;
	while (!Q.empty()) {
		int node = Q.front();
		Q.pop();
		inq[node] = 0;
		for (auto x : G[node])
			if (c[node][x.first] && dd[node] + x.second < dd[x.first]) {
				dd[x.first] = dd[node] + x.second;
				if (!inq[x.first]) {
					inq[x.first] = 1;
					Q.emplace(x.first);
				}
			}
	}
	while (1) {
		auto comp = [&](pi a, pi b) {
			return a.second > b.second;
		};
		priority_queue<pi, vector<pi>, decltype(comp)> Q(comp);
		vector<int> last(n + 1, -1), dp(n + 1, 0x3F3F3F3F), dp2(n + 1);
		Q.emplace(s, 0);
		dp[s] = 0;
		while (!Q.empty()) {
			int node, cost;
			tie(node, cost) = Q.top();
			Q.pop();
			if (dp[node] == cost)
				for (auto x : G[node])
					if (c[node][x.first] && cost + x.second + dd[node] - dd[x.first] < dp[x.first]) {
						last[x.first] = node;
						dp[x.first] = cost + x.second + dd[node] - dd[x.first];
						dp2[x.first] = dp2[node] + x.second;
						Q.emplace(x.first, cost + x.second + dd[node] - dd[x.first]);
					}
		}
		int curflow = INT_MAX;
		if (last[t] == -1)
			break;
		for (int i = t; i != s; i = last[i])
			curflow = min(curflow, c[last[i]][i]);
		for (int i = t; i != s; i = last[i]) {
			c[last[i]][i] -= curflow;
			c[i][last[i]] += curflow;
		}
		cost += dp2[t] * curflow;
		flow += curflow;
	}
	cout << cost << '\n';
}