#include <fstream>
#include <iostream>
#include <vector>
#include <list>
#define nmax 1001
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector < int > vec[nmax];
list < int > coada;
int n,flux[nmax][nmax],c[nmax][nmax],viz[nmax],tata[nmax];
int bfs()
{
    int i,j, nod;
    for(i=1;i<=n;i++) viz[i]=0;
    viz[1]=1;
    coada.push_back(1);
    while(!coada.empty())
    {
        nod=coada.front();
        for(i=0;i<vec[nod].size();i++)
        {
            j=vec[nod][i];
            if(j==n && flux[nod][n]) {viz[n]=1; continue;}
            if(viz[j] || !flux[nod][j]) continue;

            tata[j]=nod; viz[j]=1;
            coada.push_back(j);
        }
        coada.pop_front();
    }

    return viz[n];
}
int main()
{
    int i,j,x,y,m,z,fmin,fmax=0,nod;
    f>>n>>m;
    for(i=0;i<m;i++)
    {
        f>>x>>y>>z;
        vec[x].push_back(y);
        vec[y].push_back(x);
        flux[x][y]=z;
    }
    for(fmax=0; bfs();)
    {
        for(i=0;i<vec[n].size();i++)
        {
            fmin=110001;
            nod=vec[n][i];
            tata[n]=nod;
            for(j=n;j!=1;j=tata[j])
            {
                if(fmin>flux[tata[j]][j]) fmin=flux[tata[j]][j];
            }
            if(!fmin) continue;
            for(j=n;j!=1;j=tata[j])
            {
                flux[tata[j]][j]-=fmin;
                flux[j][tata[j]]+=fmin;
            }
            fmax+=fmin;
        }
    }
    g<<fmax;
}