#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
FILE*in=fopen("maxflow.in","r");
FILE*out=fopen("maxflow.out","w");
const int INF=1000000004;
int n,m,i,x,xx,y,z,sum,fluxy;
int mat[1003][1003],cap[1003][1003],dad[1003];
bool b[1003];
bool as;
vector<int> v[1003];
int fl(int act)
{
    if(act==n)
    {
        as=1;
        return INF;
    }
    b[act]=1;
    int flux=0;
    for(int t=0;t<v[act].size();t++)
    {
        if(b[v[act][t]]==0&&mat[act][v[act][t]]-cap[act][v[act][t]]>0)
        {
            flux=min(mat[act][v[act][t]]-cap[act][v[act][t]],fl(v[act][t]));
            if(as==1)
            {
                dad[v[act][t]]=act;
            }
        }
        if(flux>0)
        {
            return flux;
        }
    }
    return 0;
}
int main()
{
    fscanf(in,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d%d",&x,&y,&z);
        mat[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    fluxy=fl(1);
    xx=n;
    while(dad[xx]!=0)
    {
        cap[dad[xx]][xx]+=fluxy;
        cap[xx][dad[xx]]-=fluxy;
        xx=dad[xx];
    }
    while(fluxy>0)
    {
        memset(b,0,sizeof(b));
        as=0;
        sum+=fluxy;
        fluxy=fl(1);
        xx=n;
        while(dad[xx]!=0)
        {
            cap[dad[xx]][xx]+=fluxy;
            cap[xx][dad[xx]]-=fluxy;
            xx=dad[xx];
        }
    }
    fprintf(out,"%d",sum);
}