#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
bool fost[1011];
int c[1011][1011],ante[1011],n;
vector <int> v[1011];
bool flux()
{
    queue <int> q;
    memset(fost,0,sizeof(fost));
    q.push(1);
    fost[1]=1;
    while(q.empty()==false)
    {
        int k=q.front();
        q.pop();
        if(k==n)
            continue;
        for(auto it=v[k].begin();it!=v[k].end();it++)
        {
            if(fost[*it]==1 || c[k][*it]<=0)
                continue;
            fost[*it]=1;
            q.push(*it);
            ante[*it]=k;
        }
    }
    return fost[n];
}
int m,i,j,x,y,z,minc,sol;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        c[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(flux()==true)
    {
        for(auto it=v[n].begin();it!=v[n].end();it++)
        {
            if(fost[*it]==0 || c[*it][n]<=0)
                continue;
            ante[n]=*it;
            minc=10000001;
            for(j=n;j!=1;j=ante[j])
                minc=min(minc,c[ante[j]][j]);
            if(minc==0)
                continue;
            for(j=n;j!=1;j=ante[j])
            {
                c[ante[j]][j]=c[ante[j]][j]-minc;
                c[j][ante[j]]=c[j][ante[j]]+minc;
            }
            sol=sol+minc;
        }
    }
    g<<sol;
    return 0;
}