#include <stdio.h>

#define DIM 1005
#define oo 11005

struct nod {int x;
            nod *urm;} *lst[DIM];
int c[DIM][DIM],f[DIM][DIM];
int q[DIM],t[DIM];
int n,m,minim,flow;

void add (int a,int b)
{
    nod *p=new nod;
    
    p->x=a;
    p->urm=lst[b];
    lst[b]=p;
}

void read ()
{
	int i,x,y,z;

	scanf ("%d%d",&n,&m);
	for (i=1; i<=m; ++i)
	{
		scanf ("%d%d%d",&x,&y,&z);
		c[x][y]=z;
		add (x,y);
		add (y,x);
	}
}

int bf ()
{
    nod *p;
    int st,dr,i;

    for (i=1; i<=n; ++i)
        t[i]=0;
    for (q[st=dr=1]=1; st<=dr; ++st)
        for (p=lst[q[st]]; p; p=p->urm)
            if (!t[p->x] && c[q[st]][p->x]>f[q[st]][p->x])
            {
                t[p->x]=q[st];
                q[++dr]=p->x;
            }
    return t[n];
}

int min (int a,int b)
{
    if (a<b)
        return a;
    return b;
}

void solve ()
{
    int i,j;

    for ( ; bf (); )
		for (i=1; i<=n; ++i)
		    if (t[i]>0 && c[i][n]-f[i][n]>0)
		    {
				minim=c[i][n]-f[i][n];
    			for (j=i; j!=1; j=t[j])
    				minim=min (minim,c[t[j]][j]-f[t[j]][j]);
                f[i][n]+=minim;
                f[n][i]-=minim;
    			for (j=i; j!=1; j=t[j])
                {
                    f[t[j]][j]+=minim;
                    f[j][t[j]]-=minim;
                }
                flow+=minim;
        	}

    printf ("%d",flow);
}

int main ()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);

    read ();
    solve ();

    return 0;
}