#include <bits/stdc++.h>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector<int> adj[1001];
int MaxFLOW,flow,fluxmin,fluxmax;
int i,j,k,n,m,C[1001][1001],viz[1001],x,y,z,fth[1001],nod,F[1001][1001];
queue<int>q;
int bfs()
{
    int top,next;
    memset(viz,0,sizeof(viz));
    viz[1] = 1;
    q.push(1);
    while(q.empty() == false)
    {
        top = q.front();
        q.pop();
        for(int i=0; i<adj[top].size(); i++)
        {
            next = adj[top][i];
            if(viz[next] == 0 && F[top][next] < C[top][next])
            {
                viz[next] = 1;
                if(next != n)
                    q.push(next);
                fth[next] = top;
            }
        }
    }
    return viz[n];
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>z;
        C[x][y] = z;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    for(MaxFLOW = 0; bfs(); MaxFLOW += fluxmin)
    {
        for(int i=0; i<adj[n].size(); i++)
        {
            fluxmin = 10e7;
            if(!viz[adj[n][i]])
                continue;
            fth[n] = adj[n][i];
            for(nod = n; nod != 1; nod = fth[nod])
            {
                fluxmin = min(fluxmin,C[fth[nod]][nod] - F[fth[nod]][nod]);
            }
            for (nod = n; nod != 1; nod = fth[nod])
            {
                F[fth[nod]][nod] += fluxmin;
                F[nod][fth[nod]] -= fluxmin;
            }
        }
        MaxFLOW += fluxmin;
    }
    g<<MaxFLOW;
    return 0;
}