#include<stdio.h>
#include<vector>
#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],T(maxn),viz(maxn);
queue <int> Q;
int C[maxn][maxn],F[maxn][maxn];
int x,y,c,flow,fmin,m,n;
int bfs(){
	for(int i=0;i<viz.size();i++)
		viz[i]=0;
	viz[1]=1;
	Q.push(1);
	while(Q.empty()==0){
		x=Q.front();
		Q.pop();
		if(x==n)
			continue;
		for(int i=0;i<G[x].size();i++)
			if(viz[G[x][i]]==0){
				int nod=G[x][i];
				if(C[x][nod]==F[x][nod] || viz[nod])
					continue;
				Q.push(G[x][i]);
				T[G[x][i]]=x;
				viz[G[x][i]]=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;
	while(bfs())
		for(int i=0;i<G[n].size();i++){
			int nod=G[n][i];
			if(F[nod][n] == C[nod][n] || !viz[nod])
				continue;
			
			T[n]=nod;
			fmin=INF;
			
			for(nod=n;nod!=1;nod=T[nod])
				fmin=min(fmin,C[T[nod]][nod]-F[T[nod]][nod]);
			
			if(fmin==0)
				continue;
			
			for(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;
}