#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
#define lim 5010

typedef vector<int> :: iterator iter;
vector <int> G[lim];

int C[lim][lim], F[lim][lim];
int q[lim], st, dr, viz[lim];
int nod, n, dad[lim];


bool bfs()
{
    st = 0;
    dr = -1;
    memset(viz, 0, sizeof(viz));
    q[++dr] = 1;
    viz[1] = 1;
    while(st <= dr)
    {
        nod = q[st++];
        for(auto it:G[nod])
        {
            if(!viz[it] && F[nod][it] < C[nod][it])
            {
                viz[it] = 1;
                if(it == n)
                    continue;
                q[++dr] = it;
                dad[it] = nod;

            }
        }
    }
    return viz[n];
}

int main()
{
    int m, x, y, flow, maxflow = 0, i;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        fin >> C[x][y];
        G[x].push_back(y);
        G[y].push_back(x);
    }
    while(bfs())
    {

        for(auto it:G[n])
        {

            if(C[it][n] - F[it][n] > 0)
            {
                dad[n] = it;
                flow = 2000000000;
                for(i = n ; dad[i] ; i = dad[i])
                {
                    flow = min(flow, C[dad[i]][i] - F[dad[i]][i]);
                }
                for(i = n ; dad[i] ; i = dad[i])
                {
                    F[dad[i]][i] += flow;
                    F[i][dad[i]] -= flow;
                }
                maxflow += flow;
            }

        }
    }
    fout << maxflow << "\n";
}