#include<vector>
#include<stdio.h>
#include<queue>
using namespace std;
#define maxn 1005
#define maxm 5005
#define INF 999999
FILE *f=fopen("maxflow.in","r");
FILE *g=fopen("maxflow.out","w");
vector <int> G[maxm],viz(maxn),T(maxn);
queue <int> Q;
int C[maxn][maxn],F[maxn][maxn];
int n,m,x,y,c,flow,fmin;
int bfs(){
	for(int i=1;i<viz.size();i++)
		viz[i]=0;
	viz[1]=1;
	Q.push(1);
	while(Q.empty()==0){
		int nod=Q.front();
		Q.pop();
		if(nod==n)
			continue;
		for(int i=0;i<G[nod].size();i++){
			int x=G[nod][i];
			if(C[nod][x]==F[nod][x] || viz[x])
				continue;
			Q.push(x);
			T[x]=nod;
			viz[x]=1;
		}
	}
	return viz[n];
}
int main (){
	fscanf(f,"%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		fscanf(f,"%d%d%d",&x,&y,&c);
		G[x].push_back(y);
		G[y].push_back(x);
		C[x][y]=c;
	}
	flow=0;
	for(;bfs();)
		for(int i=0;i<G[n].size();i++){
			int x=G[n][i];
			if(viz[x]==0 || F[x][n]==C[x][n])
				continue;
			T[n]=x;
			fmin=INF;
			for(int nod=n;nod!=1;nod=T[nod])
				fmin=min(fmin,C[T[nod]][nod]-F[T[nod]][nod]);
			if(fmin==0)
				continue;
			for(int nod=n;nod!=1;nod=T[nod])
			{
				F[T[nod]][nod]+=fmin;
				F[nod][T[nod]]-=fmin;
			}
			flow+=fmin;
		}
	fprintf(g,"%d",flow);
	return 0;
}