#include <bits/stdc++.h>
using namespace std;
 
const int N = 1005;
const int inf = 0x3f3f3f3f;
 
int i, n, m, x, y, z, capacity[N][N], flow[N][N], height[N], excess[N], seen[N];
queue<int> excess_vertices;

void push(int u, int v)
{
    int d = min(excess[u], capacity[u][v] - flow[u][v]);
    flow[u][v] += d;
    flow[v][u] -= d;
    excess[u] -= d;
    excess[v] += d;
    if (d && excess[v] == d)
        excess_vertices.push(v);
}

void relabel(int u)
{
    int d = inf;
    for (int i = 0; i < n; i++) {
        if (capacity[u][i] - flow[u][i] > 0)
            d = min(d, height[i]);
    }
    if (d < inf)
        height[u] = d + 1;
}

void discharge(int u)
{
    while (excess[u] > 0) {
        if (seen[u] < n) {
            int v = seen[u];
            if (capacity[u][v] - flow[u][v] > 0 && height[u] > height[v])
                push(u, v);
            else 
                seen[u]++;
        } else {
            relabel(u);
            seen[u] = 0;
        }
    }
}

int max_flow()
{
    height[0] = n;
    excess[0] = inf;
    for (int i = 1; i < n; i++)
        push(0, i);
    while (!excess_vertices.empty()) {
        int u = excess_vertices.front();
        excess_vertices.pop();
        if (u != 0 && u != n - 1)
            discharge(u);
    }
	return excess[n - 1];
}

int main() {
	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);
	for(scanf("%d %d", &n, &m); m; --m) {
		scanf("%d %d %d", &x, &y, &z);
		--x; --y;
		capacity[x][y] += z;
	}
	printf("%d\n", max_flow());
	return 0;
}