#include<cstdio>
#include<algorithm>
#include<deque>
#include<vector>
#include<cstring>
#include<climits>
using namespace std;
int m,n,i,j,k,x,y,rez,minflow,viz[1005];
int flux[1005][1005];
vector<int>v[1005];
deque<int>c;

bool df(int x)
{
	memset(viz,0,sizeof(viz));
	viz[x]=-1;
	while (!c.empty()) c.pop_front();
	c.push_back(x);
	while (!c.empty())
	{
		x=c.front();
		if (x==n) return true;
		c.pop_front();
		for (j=0;j<v[x].size();j++)
			if (!viz[v[x][j]] && flux[x][v[x][j]])	viz[v[x][j]]=x,c.push_back(v[x][j]);
	}
	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,&k),v[x].push_back(y),v[y].push_back(x),flux[x][y]=k;
	while (df(1))
	{
		for (j=0;j<v[n].size();j++)
			{
				viz[n]=v[n][j];
				minflow=LONG_MAX;
				for (i=n;viz[i]!=-1;i=viz[i])	minflow=min(minflow,flux[viz[i]][i]);
				if (minflow)
				{
					for (i=n;viz[i]!=-1;i=viz[i])
						flux[viz[i]][i]-=minflow,flux[i][viz[i]]+=minflow;
					rez=rez+minflow;
				}
		}
	}
	printf("%d\n",rez);
	return 0;
}