#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

vector<vector<int>> adjl;
vector<vector<int>> adjm;
const int oo = 1<<30;

int main() {
	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	adjl.resize(n);
	adjm.assign(n, vector<int>(n));
	for (int i = 0; i < m; ++i) {
		int u, v, c;
		cin >> u >> v >> c;
		u--, v--;
		adjl[u].push_back(v);
		adjl[v].push_back(u);
		adjm[u][v] = c;
	}
	int flow = 0;
	while (true) {
		bool reach_sink = false;
		queue<int> q;
		q.push(0);
		vector<int> par(n);
		vector<bool> vis(n);
		vis[0] = true;
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			for (int v: adjl[u]) {
				if (vis[v] || adjm[u][v] == 0) continue;
				q.push(v);
				par[v] = u;
				vis[v] = true;
				if (v == n-1) {
					reach_sink = true;
					break;
				}
			}
			if (reach_sink) break;
		}
		if (!reach_sink) break;
		int cap = oo;
		for (int v = n-1; v != 0; v = par[v]) {
			cap = min(cap, adjm[par[v]][v]);
		}
		for (int v = n-1; v != 0; v = par[v]) {
			adjm[par[v]][v] -= cap;
			adjm[v][par[v]] += cap;
		}
		flow += cap;
	}
	printf("%d\n", flow);
}