#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin ("maxflow.in");
ofstream fout ("maxflow.out");

vector <int> v[1001];
int c[1001][1001];

int bfs (int s, int t, int p[])
{
    int i, na, nv;
    int flux[1001] = {};
    queue <int> q;

    flux[s] = 1<<30;
    q.push (s);

    while (q.empty() == 0)
    {
        na = q.front();
        q.pop();

        for (i = 0; i<v[na].size(); i++)
        {
            nv = v[na][i];
            if (flux[nv] == 0 && c[na][nv] != 0)
            {
                flux[nv] = min (flux[na], c[na][nv]);
                p[nv] = na;

                if (nv == t)
                    return flux[nv];
                q.push (nv);
            }
        }
    }
    return 0;
}

int main()
{
    int n, m, i, x, y, z, s, t, rasp, flux, p[1001];

    fin >> n >> m;
    for (i = 1; i<=m; i++)
    {
        fin >> x >> y >> z;

        v[x].push_back (y);
        v[y].push_back (x);
        c[x][y] += z;
    }

    s = 1;
    t = n;

    rasp = 0;
    do
    {
        flux = bfs (s, t, p);
        rasp += flux;
        x = t;
        while (x != s)
        {
            y = p[x];
            c[y][x] -= flux;
            c[x][y] += flux;
            x = y;
        }
    } while (flux > 0);

    fout << rasp;
    return 0;
}