#include <stdio.h>
#include <vector>
#define NMAX 1024
#define Inf 0x3f3f3f

using namespace std;

int c[NMAX][NMAX];
int f[NMAX][NMAX];
int t[NMAX];
vector<int> g[NMAX];
int n, m;
int cd[NMAX];
int viz[NMAX];

int Bf()
{
	int nod,V;
	memset(viz,0,sizeof(viz));
	viz[1]=1;
	cd[0]=1;
	cd[1]=1;

	for (int i=1;i<=cd[0];i++)
	{
		nod=cd[i];
                if (nod==n)
                    continue;
		for (int j=0;j<g[nod].size();j++)
			{
				V=g[nod][j];
				if (c[nod][V]==f[nod][V] || viz[V])
                         continue;
				viz[V]=1;
				cd[++cd[0] ]=V;
				t[V]=nod;
			}
	}
	return viz[n];
}

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

	int flow,fmin,x,y,z,nod;

	scanf("%d %d ",&n,&m);

	for (int i=1;i<=m;i++)
	{
		scanf("%d %d %d ",&x,&y,&z);
		c[x][y]+=z;
		g[x].push_back(y);
		g[y].push_back(x);
	}
     flow=0;
     while (Bf())
		for (int i=0;i<g[n].size();i++)
		{
			nod=g[n][i];
			if (f[nod][n]==c[nod][n] || !viz[nod])
                    continue;
			t[n]=nod;
			fmin=Inf;
			for (nod=n;nod!=1;nod=t[nod])
				fmin=min(fmin,c[t[nod]][nod]-f[t[nod]][nod]);

			if (fmin==0)
                    continue;

			for (nod=n;nod!=1;nod=t[nod])
			{
				f[t[nod]][nod]+=fmin;
				f[nod][t[nod]]-=fmin;
			}
			flow+=fmin;
		}

	printf("%d ",flow);
	return 0;
}