#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("fmcm.in");
ofstream fout ("fmcm.out");
void read();
int n, m, S, D;
int minn, zmax;
vector<int> v[355];
bitset<355> viz;
int c[355][355], f[355][355], z[355][355];
int d[355], p[355], cost, b[355], r[355];
void bellman()
{
    queue<int> q;
    for(int i=1; i<=n; i++)
        b[i] = INT_MAX;
    b[S] = 0;
    q.push(S);
    viz[S] = 1;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        viz[nod] = 0;
        for(auto it:v[nod])
            if(b[nod] + z[nod][it] < b[it] && c[nod][it] - f[nod][it] > 0)
            {
                b[it] = b[nod] + z[nod][it];
                if(!viz[it])
                q.push(it), viz[it] = 1;
            }
    }
}
int cst_transform(int x, int y)
{
    return z[x][y] + b[x] - b[y];
}
bool dijkstra()
{
    for(int i=1; i<=n; i++)
        d[i] = INT_MAX;
    for(int i=1; i<=n; i++)
        viz[i] = 0;
    minn = INT_MAX;
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
    q.push(pair<int,int>(0, S));
    d[S] = 0;
    r[S] = 0;
    while(!q.empty())
    {
        int nod = q.top().second, cst = q.top().first;
        q.pop();
        if(d[nod]!=cst)
            continue;
        if(viz[nod])
            continue;
        viz[nod] = 1;
        for(auto it:v[nod])
            if(d[nod] + cst_transform(nod, it) < d[it] &&
                    c[nod][it] - f[nod][it] > 0)
            {
                r[it] = z[nod][it] + r[nod];
                d[it] = d[nod] + cst_transform(nod, it);
                p[it] = nod;
                q.push(pair<int,int>(d[it], it));
            }
    }
    for(int i=1; i<=n; i++)
        b[i] = d[i];
    if(d[D] == INT_MAX)
        return 0;
    int nod = D;
    vector<pair<int,int>> edges;
    while(p[nod])
    {
        minn = min(minn, c[p[nod]][nod]-f[p[nod]][nod]);
        edges.push_back(pair<int,int>(p[nod], nod));
        nod = p[nod];
    }
    for(auto it:edges)
    {
        f[it.first][it.second]+=minn;
        f[it.second][it.first]-=minn;
    }
    cost+=minn*r[D];
    return 1;
}
int main()
{
    read();
    bellman();
    while(dijkstra());
    fout << cost;

    return 0;
}
void read()
{
    fin >> n >> m >> S >> D;
    for(int i=1; i<=m; i++)
    {
        int x, y, C, Z;
        fin >> x >> y >> C >> Z;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y] = C;
        z[x][y] = Z;
        z[y][x] = -Z;
    }
}