#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
#define N 1010
#define inf -(1<<30)
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector<int> v[N];
queue<int> q;
int n,m,fmin,j,i,x,y,C[N][N],F[N][N],viz[N],T[N],des,flux,nod;
int bfs()
{
	q.push(1);
	memset(viz,0,sizeof(viz));
	viz[1]=1;
	while(!q.empty())
	{
		nod=q.front();
		q.pop();
		if(nod==n) continue;
		for(i=0;i<v[nod].size();++i)
		{
			des=v[nod][i];
			if(viz[des]||C[nod][des]==F[nod][des]) continue;
			q.push(des);
			viz[des]=1;
			T[des]=nod;
		}
	}
	return viz[n];
}
int main ()
{
	f>>n>>m;
	for(i=1;i<=m;++i)
	{
		f>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
		f>>C[x][y];
	}
	for(flux=0;bfs();)
	for(i=0;i<v[n].size();++i)
	{
		des=v[n][i];
		if(C[v[des][n]]==F[v[des][n]]||!viz[des]) continue;
		T[n]=des;
		
		fmin=inf;
		for(j=n;j!=1;j=T[j])
			fmin=min(fmin,C[T[j]][j]-F[T[j]][j]);
		if(!fmin) continue;
		for(j=n;j!=1;j=T[j])
		{
			F[T[j]][j]+=fmin;
			F[j][T[j]]-=fmin;
		}
		flux+=fmin;
	}
	g<<flux;
	return 0;
}