#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>

#define oo 1000000000

using namespace std;

int n, s, d;
vector<int> G[360];
int c[360][360];
int cost[360][306];

int ds[360];
int real[360];
int mn[360];
int tata[360];
bool vis[360];
priority_queue< pair< int, int>, vector< pair<int, int> >, greater< pair<int, int> > > pq;

int fluxCost, aux;

bool dijkstra() {
    for(int i = 1; i <= n; i ++)
        ds[i] = real[i] = oo;
    ds[s] = real[s] = 0;
    pq.push({0, s});
    while(!pq.empty()) {
        int kost = pq.top().first;
        int act = pq.top().second;
        pq.pop();
        if(kost != ds[act]) continue;

        for(vector<int>::iterator it = G[act].begin(); it != G[act].end(); it ++) {

            if(c[act][*it] > 0) {

                aux = ds[act] + cost[act][*it] + mn[act] - mn[*it];

                if(aux < ds[*it]) {
                    ds[*it] = aux;
                    real[*it] = real[act] + cost[act][*it];
                    tata[*it] = act;
                    pq.push({ds[*it], *it});
                }
            }
        }
    }
    memcpy(mn, real, sizeof(mn));

    if(ds[d] == oo) return false;
    return true;
}



queue<int> q;
bool bellmanFord() {

    int aux;
    for(int i = 1; i <= n; i ++)
        mn[i] = oo;

    mn[s] = 0;
    q.push(s);

    while(!q.empty()) {
        int act = q.front();
        vis[act] = false;
        q.pop();

        for(vector<int>::iterator it = G[act].begin(); it != G[act].end(); it ++) {

            if(c[act][*it] > 0) {
                if(mn[*it] > mn[act] + cost[act][*it]) {
                    mn[*it] = mn[act] + cost[act][*it];
                    tata[*it] = act;
                    if(!vis[*it]) {
                        vis[*it] = true;
                        q.push(*it);
                    }
                }
            }
        }
    }
    if(mn[d] == oo)
        return false;
    return true;
}

int main()
{
    ifstream f("fmcm.in");
    ofstream g("fmcm.out");
    int m, x, y;
    f >> n >> m >> s >> d;
    for(; m; m --) {
        f >> x >> y;
        f >> c[x][y] >> cost[x][y];
        cost[y][x] = -cost[x][y];
        G[x].push_back(y);
        G[y].push_back(x);
    }

    if(bellmanFord()) {
        while(dijkstra()) {
            int cmn = oo;
            for(int i = d; i != s; i = tata[i])
                cmn = min(cmn, c[tata[i]][i]);
            for(int i = d; tata[i]; i = tata[i]) {
                c[tata[i]][i] -= cmn;
                c[i][tata[i]] += cmn;
            }
            fluxCost += cmn * real[d];
        }
    }
    g << fluxCost << "\n";
    return 0;
}