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

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