#include <fstream>
#include <vector>
#include <string.h>
using namespace std;

#define NMAX 1024
#define INF 0x3f3f3f3f
int C[NMAX][NMAX];
int F[NMAX][NMAX];
int TT[NMAX];
vector<int> G[NMAX];
int n,m;
int cd[NMAX];
int viz[NMAX];
ifstream f ("maxflow.in");
ofstream g("maxflow.out");

int bfs()
{
    int i, j, nod, V;

    cd[0] = 1;
    cd[1] = 1;
    memset(viz, 0, sizeof(viz));
    viz[1] = 1;

    for (i = 1; i <= cd[0]; i++)
    {
        nod = cd[i];
                if (nod == n) continue;
        for (j = 0; j < G[nod].size(); j++)
            {
                V = G[nod][j];
                if (C[nod][V] == F[nod][V] || viz[V]) continue;
                viz[V] = 1;
                cd[ ++cd[0] ] = V;
                TT[V] = nod;
            }
    }

    return viz[n];
}

int main()
{


    int i, flow, fmin, x, y, c, nod;

    f>>n>>m;

    for (i = 1; i <= m; i++)
    {
        f>>x>>y>>c;
        C[x][y]+=c;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for (flow = 0; bfs();)
        for (i=0;i < G[n].size(); i++)
        {
            nod = G[n][i];
            if (F[nod][n] == C[nod][n] || !viz[nod]) continue;
            TT[n] = nod;
            fmin=INF;
            for (nod=n;nod !=1;nod =TT[nod])
                fmin=min(fmin,C[TT[nod]][nod]-F[TT[nod]][nod]);
            if (fmin==0) continue;

            for (nod=n;nod!=1; nod=TT[nod])
            {
                F[ TT[nod] ][nod] += fmin;
                F[nod][ TT[nod] ] -= fmin;
            }

            flow += fmin;
        }

   g<<flow;
    return 0;
}