#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
FILE *in = freopen("maxflow.in", "r", stdin), *out = freopen("maxflow.out", "w", stdout);

int n, m, C[1001][1001], F[1001][1001], prec[1001], viz[1001];
vector <int> G[1001];
queue <int> q;
	
void BFS(){
	int i, nod, adj;
	for (i = 1; i <= n; i++) prec[i] = -1, viz[i] = 0;
	q.push(1), viz[1] = 1;
	
	while(!q.empty()){
		nod = q.front(), q.pop();
		for (i = 0; i < 
			G[nod].size() && (adj = G[nod][i]); i++)
			if (F[nod][adj] < C[nod][adj] && !viz[adj]){
				q.push(adj);
				viz[adj] = 1;
				prec[adj] = nod;
			}
	}
}

int main(){
	int i, x, y, c, maxflow = 0, nod, flow_aug;
	
	scanf("%d %d", &n, &m);
	for (i = 0; i < m; i++){
		scanf("%d %d %d", &x, &y, &c);
		G[x].push_back(y);
		G[y].push_back(x);
		C[x][y] = c;
	}
	
	while (flow_aug != 0xfffffff)
		for (BFS(), i = 0; i < G[n].size(); i++){
			flow_aug = 0xfffffff;
			nod = n;
			
			while (prec[nod] > -1){				//calculez cu cat pot creste fluxul
				flow_aug = min( C[prec[nod]][nod] - F[prec[nod]][nod], flow_aug );
				nod = prec[nod];
			}
			
			nod = G[n][i];
			while (prec[nod] > -1){				//actualizez cel mai bun flux gasit pana acum
				F[prec[nod]][nod] += flow_aug;
				F[nod][prec[nod]] -= flow_aug;
				nod = prec[nod];
			}
			if (flow_aug != 0xfffffff) maxflow += flow_aug;
			else break;
		}
		
	printf("%d\n", maxflow);
}