#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;

int i,j,n,m,c[1001][1001],fl[1001][1001],x,y,flux,d[1001],min1,rez=0;
vector<int> a[1001];
queue<int> q;
bool viz[1001];
bool bf()
{
	int x,i;
	q.push(1);
	memset(viz,0,sizeof(viz));
	memset(d,0,sizeof(d));
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(i=0;i<a[x].size();++i)
			if(!viz[a[x][i]]&&fl[x][a[x][i]]<c[x][a[x][i]])
			{
				viz[a[x][i]]=1;
				d[a[x][i]]=x;
				q.push(a[x][i]);
			}
	}
	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,&flux);
		a[x].push_back(y);
		a[y].push_back(x);
		c[x][y]=flux;
	}
	while(bf())
	{
		for(i=1;i<n;++i)
			if(d[i]&&fl[i][n]<c[i][n])
			{
				min1=c[i][n]-fl[i][n];
				for(j=i;j!=1;j=d[j])
					if(c[d[j]][j]-fl[d[j]][j]<min1)
						min1=c[d[j]][j]-fl[d[j]][j];
					if(min1)
					{
						fl[i][n]+=min1;
						fl[n][i]-=min1;
						for(j=i;j!=1;j=d[j])
						{
							fl[d[j]][j]+=min1;
							fl[j][d[j]]-=min1;
						}
						rez+=min1;
					}
			}
	}
	printf("%d",rez);
	return 0;
}