#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
#define nrn 1005
#define inf INT_MAX

vector<int>V[nrn];
queue<int>Q;
int C[nrn][nrn],F[nrn][nrn],grint[nrn],grext[nrn],flux,n;
int tata[nrn];

FILE *in=fopen("maxflow.in","r"),*out=fopen("maxflow.out","w");

int bfs()
{
	int uz[nrn],i,node,v;
	memset(uz,0,sizeof(uz));
	/*for(i=0;i<V[0].size();++i)
	{
		Q.push(V[0][i]);
		tata[V[0][i]]=V[0][i];
		uz[V[0][i]]=1;
	}*/
	Q.push(1);
	tata[1]=1;
	uz[1]=1;
	while(!Q.empty())
	{
		node=Q.front();
		Q.pop();
		if(node==n)
		{
			while(!Q.empty())
				Q.pop();
			return node;
		}
		for(i=0;i<V[node].size();++i)
		{
			v=V[node][i];
			if(!(C[node][v]==F[node][v])&&!uz[v])
			{
				uz[v]=1;
				tata[v]=node;
				Q.push(v);
			}
		}
	}
	return 0;
}
int main()
{
	int a,b,cost,m,nod,tt,i;
	fscanf(in,"%d%d",&n,&m);
	for(i=1;i<=m;++i)
	{
		fscanf(in,"%d%d%d",&a,&b,&cost);
		V[a].push_back(b);
		V[b].push_back(a);
		C[a][b]=cost;
		grext[a]++;
		grint[b]++;
	}
	/*for(i=1;i<=n;++i)
		if(!grint[i])
			V[0].push_back(i);*/
	nod=bfs();
	while(nod)
	{
		a=nod;
		tt=tata[nod];
		cost=inf;
		while(tt!=nod)
		{
			cost=min(cost,C[tt][nod]-F[tt][nod]);
			nod=tt;
			tt=tata[tt];
		}
		flux+=cost;
		nod=a;
		tt=tata[nod];
		F[tt][nod]+=cost;
		F[nod][tt]-=cost;
		while(tt!=nod)
		{
			nod=tt;
			tt=tata[tt];
			F[tt][nod]+=cost;
			F[nod][tt]-=cost;
		}
		nod=bfs();
	}
	fprintf(out,"%d\n",flux);
	return 0;
}