#include <fstream>
#include <vector>
#define NMAX 1010
#define INF 100000010

using namespace std;

FILE *fin, *fout;

int n, m, sursa, dest, ic, sc, C[NMAX], F[NMAX][NMAX], cap[NMAX][NMAX], tata[NMAX], cd[NMAX];
vector<int> A[NMAX];
bool viz[NMAX];

bool BFS();

int main()
{
    int i, x, y, z, nod, flow, fmin;
    fin = fopen("maxflow.in", "r");
    fout = fopen("maxflow.out", "w");
    fscanf(fin, "%d%d", &n, &m);
    for (i = 1; i <= m; i++)
    {
        fscanf(fin, "%d%d%d", &x, &y, &z);
        A[x].push_back(y);
        A[y].push_back(x);
        cap[x][y] += z;
    }
    for (flow = 0; BFS(); )
    {
        for (i = 0; i < A[n].size(); i++)
        {
            nod = A[n][i];
            if (F[nod][n] == cap[nod][n] || !viz[nod])
                continue;
            tata[n] = nod;
            fmin = INF;
            for (nod = n; nod != 1; nod = tata[nod])
                fmin = min(fmin, cap[tata[nod]][nod] - F[tata[nod]][nod]);
            if (!fmin)
                continue;
            for (nod = n; nod != 1; nod = tata[nod])
            {
                F[tata[nod]][nod] += fmin;
                F[nod][tata[nod]] -= fmin;
            }
            flow += fmin;
        }
    }
    fprintf(fout, "%d\n", flow);
    fclose(fout);
    return 0;
}

bool BFS()
{
    int i, nod, urm;
    ic = sc = 0;
    C[sc] = 1;
    for (i = 1; i <= n; i++)
        viz[i] = 0;
    viz[1] = 1;
    while (ic <= sc)
    {
        nod = C[ic++];
        if (nod == n)
            continue;
        for (i = 0; i < A[nod].size(); i++)
        {
            urm = A[nod][i];
            if (cap[nod][urm] == F[nod][urm] || viz[urm])
                continue;
            viz[urm] = 1;
            tata[urm] = nod;
            C[++sc] = urm;
        }
    }
    return viz[n];
}