#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int c[1001][1001],f[1001][1001],t[1001];
vector<int> g[1001];
queue<int>q;
int n, m, x, y, z, fmin,flow;
bool vis[1001];

int BF()
{
    q.push(1);
    memset(vis, 0, sizeof(vis));
    vis[1] = 1;
    for (;!q.empty();q.pop())
    {
        int nod=q.front();
        if (nod == n) continue;
        for (vector<int>::iterator it=g[nod].begin(); it<g[nod].end(); it++)
            {
                if (c[nod][*it] == f[nod][*it] || vis[*it]) continue;
                vis[*it] = 1;
                q.push(*it);
                t[*it] = nod;
            }
    }
    return vis[n];
}

int main()
{

    fin>>n>>m;
    for (int i = 1; i <= m; i++)
    {
        fin>>x>>y>>z;
        c[x][y]=z;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for (flow = 0; BF();)
        for (vector<int>::iterator it=g[n].begin(); it<g[n].end(); it++ )
        {
            if (f[*it][n] == c[*it][n] || !vis[*it]) continue;
            t[n]= *it;
            fmin = 0x3f3f3f3f;
            for (int nod = n; nod != 1; nod = t[nod])
                fmin = min(fmin, c[ t[nod] ][nod] - f[ t[nod] ][nod]);
            if (fmin == 0) continue;

            for (int nod = n; nod != 1; nod = t[nod])
            {
                f[t[nod]][nod] += fmin;
                f[nod][t[nod]] -= fmin;
            }
            flow += fmin;
        }
    fout<<flow;
    return 0;
}