#include <iostream>
#include <fstream>
using namespace std;
int n,m,i,j,x,y,z,c[1001][1001],viz[1001],prim,ultim,coada[1001],f[1001][1001],nod,t[1001],minim,flow;

int bf()
{
    for(i=1; i<=n; i++)
        viz[i]=0;
    prim=ultim=1;
    coada[prim]=1;
    while(prim<=ultim)
    {
        nod=coada[prim++];
        for(i=1; i<=n; i++)
            if(c[nod][i]-f[nod][i]>0 && viz[i]==0)
        {
            viz[i]=1;
            coada[++ultim]=i;
            t[i]=nod;
        }
    }
    return viz[n];
}

int main()
{freopen("maxflow.in", "r", stdin);
freopen("maxflow.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i=1; i<=m; i++)
    {scanf("%d%d%d", &x, &y, &z);
    c[x][y]=z;}
while(bf())
    for(j=1; j<=n; j++)
{
        if(c[j][n]-f[j][n]>0)
            {minim=c[j][n]-f[j][n];
            for(i=j; i!=1; i=t[i])
                if(c[t[i]][i]-f[t[i]][i]<minim)
                    minim=c[t[i]][i]-f[t[i]][i];
            for(i=j; i!=1; i=t[i])
                {f[t[i]][i]+=minim;
                f[i][t[i]]-=minim;}
            f[j][n]+=minim;
            f[n][j]-=minim;
            flow+=minim;}

}
printf("%d", flow);

    return 0;
}