#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int NMAX = 1055;
const int INF = 0x3f3f3f3f;

int N, M;
int cap[NMAX][NMAX];
int parent[NMAX];
vector<int> G[NMAX];

void read() {
	scanf("%d%d", &N, &M);
	int x, y, c;
	for (int edgeIdx = 0; edgeIdx < M; edgeIdx++) {
		scanf("%d%d%d", &x, &y, &c);
		cap[x][y] += c;
		G[x].push_back(y);
		G[y].push_back(x);
	}
}

int bfs(int source, int dest) {
	queue<pair<int, int>> Q;
	fill(parent + 1, parent + N + 1, -1);
	Q.push({source, INF});

	while (!Q.empty()) {
		pair<int, int> nodeAndFlowSoFar = Q.front();
		int node = nodeAndFlowSoFar.first;
		int flowSoFar = nodeAndFlowSoFar.second;
		Q.pop();

		for (int neighbour : G[node]) {
			if (parent[neighbour] == -1 && cap[node][neighbour]) {
				parent[neighbour] = node;
				int newFlow = min(flowSoFar, cap[node][neighbour]);
				if (neighbour == dest) {
					return newFlow;
				}
				Q.push({neighbour, newFlow});
			}
		}
	}

	return 0;
}

void solve(int source, int dest) {
	int flow = 0;
	int currentFlow;
	while ((currentFlow = bfs(source, dest)) > 0) {
		int currNode = dest;
		while (currNode != source) {
			cap[parent[currNode]][currNode] -= currentFlow;
			cap[currNode][parent[currNode]] += currentFlow;
			currNode = parent[currNode];
		}

		flow += currentFlow;
	}
	printf("%d\n", flow);
}

int main() {
	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);

	read();
	solve(1, N);
	return 0;
}