#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],viz[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 min (int a,int b)
{
	if (a<b)
		return a;
	return b;
}

void init ()
{
    int i;
    
    for (i=1; i<=n; ++i)
        viz[i]=0;
}

int bf ()
{
    nod *p;
    int st,dr;
    
    init ();
    for (viz[q[st=dr=1]=1]=1; st<=dr; ++st)
        if (q[st]!=n)
            for (p=lst[q[st]]; p; p=p->urm)
                if (c[q[st]][p->x]!=f[q[st]][p->x] && !viz[p->x])
                {
                    viz[p->x]=1;
                    q[++dr]=p->x;
                    t[p->x]=q[st];
                }
    return viz[n];
}

void solve ()
{
    nod *p;
    int i;
    
    for ( ; bf (); )
		for (p=lst[n]; p; p=p->urm)
			if (f[p->x][n]!=c[p->x][n] && viz[p->x]) 
            {
    			t[n]=p->x;
				minim=oo;
    			for (i=n; i!=1; i=t[i]) 
    				minim=min (minim,c[t[i]][i]-f[t[i]][i]);
    			if (minim!=0)
					for (i=n; i!=1; i=t[i])
        			{
        				f[t[i]][i]+=minim;
        				f[i][t[i]]-=minim;
                    }
    			flow+=minim;
        	}

    printf ("%d",flow);
}

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

    read ();
    solve ();

    return 0;
}