#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#define DIM 1001
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n, m, x, y, z, nod, mini, sol, t[DIM], c[DIM][DIM], f[DIM][DIM];
bool viz[DIM];
vector<int> l[DIM];
queue<int> q;

int bfs() {
	memset(viz, 0, sizeof(viz));
	q.push(1);
	viz[1] = true;
	while (!q.empty()) {
		int nod = q.front();
		q.pop();
		for (int i = 0; i < l[nod].size(); i++) {
			int vec = l[nod][i];
			if (!viz[vec] && c[nod][vec] > f[nod][vec]) {
				q.push(vec);
				viz[vec] = true;
				t[vec] = nod;
			}
		}
	}
	return viz[n];
}

int main() {
	fin >> n >> m;
	for (int i = 1; i <= m; i++) {
		fin >> x >> y >> z;
		l[x].push_back(y);
		l[y].push_back(x);
		c[x][y] = z;
	}
	while (bfs()) {
		for (int i = 0; i < l[n].size(); i++) {
			nod = l[n][i];
			if (viz[nod] && c[nod][n] > f[nod][n]) {
				mini = c[nod][n] - f[nod][n];
				x = nod;
				while (t[x] != 0) {
					mini = min(mini, c[t[x]][x] - f[t[x]][x]);
					x = t[x];
				}
				sol += mini;
				f[nod][n] += mini;
				f[n][nod] -= mini;
				x = nod;
				while (t[x] != 0) {
					f[t[x]][x] += mini;
					f[x][t[x]] -= mini;
					x = t[x];
				}
			}
		}
	}
	fout << sol;
	return 0;
}