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

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

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

bool bfsflux (int s, int t, int p[], int n)
{
    int i, na, nv;
    queue <int> q;

    for (i = 0; i<=n; i++)
    {
        flux[i] = 0;
        p[i] = -1;
    }

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

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

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

                if (v[na][i] == t)
                    return 1;

                q.push (v[na][i]);
            }
    }

    return 0;
}

int main()
{
    int p[1001];
    int lant[1001];
    int n, m, i, j, x, y, z;
    int rasp;

    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;
    }

    rasp = 0;
    while (bfsflux (1, n, p, n))
    {
        for (i = 0; i<v[n].size(); i++)
        {
            lant[0] = 0;
            p[n] = v[n][i];
            for (x = n; x != -1; x = p[x])
                lant[++lant[0]] = x;

            for (j = lant[0]-1; j>=1; j--)
                flux[lant[j]] = min (flux[lant[j+1]], c[lant[j+1]][lant[j]]);

            rasp = rasp + flux[n];
            x = flux[n];
            for (j = lant[0]-1; j>=1; j--)
            {
                c[lant[j+1]][lant[j]] -= x;
                c[lant[j]][lant[j+1]] += x;
            }
        }
    }

    fout << rasp;
    return 0;
}