#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector <int> v[1011];
int n;
bool fost[1011];
int cap[1011][1011],fol[1011][1011],ante[1011];
bool edmonds_karp()
{
    queue <int> q;
    memset(fost,0,sizeof(fost));
    fost[1]=1;
    q.push(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 || cap[k][*it]==fol[k][*it])
                continue;
            else
            {
                fost[*it]=1;
                q.push(*it);
                ante[*it]=k;
            }
    }
    return fost[n];
}
int m,x,y,z,i,j,dif,sol;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        cap[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(edmonds_karp()==true)
    {
         for(auto it=v[n].begin();it!=v[n].end();it++)
         {
             if(fost[*it]==0 || cap[*it][n]==fol[*it][n])
                continue;
             ante[n]=*it;
             dif=125000;
             for(j=n;j!=1;j=ante[j])
                dif=min(dif,cap[ante[j]][j]-fol[ante[j]][j]);
             if(dif==0)
                continue;
             for(j=n;j!=1;j=ante[j])
                {
                    fol[ante[j]][j]=fol[ante[j]][j]+dif;
                    fol[j][ante[j]]=fol[j][ante[j]]-dif;
                }
             sol=sol+dif;
         }
    }
    g<<sol;
    return 0;
}