#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <bitset>
#define MAXN 1050
#define inf 0x7fffffff

using namespace std;

vector<int> graf[MAXN];
bitset<MAXN> viz;
int n, m, capac[MAXN][MAXN], flow[MAXN][MAXN], sol;
int tat[MAXN];

void citire()
{
	int x, y, c;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d", &x, &y, &c);
		graf[x].push_back(y);
		graf[y].push_back(x);
		capac[x][y] += c;
	}
}

int BFS()
{
    viz = 0;
    queue<int> q;
    q.push(1);
	viz[1] = 1;
    while (!q.empty()) {
        int nodCrt = q.front();
        q.pop();
        if (nodCrt == n)
			continue ;
        for (int i = 0, t = graf[nodCrt].size(); i < t; i++) {
			int y = graf[nodCrt][i];
			if (viz[y] || capac[nodCrt][y]-flow[nodCrt][y] == 0) continue;
			tat[y] = nodCrt;
			viz[y] = 1;
			q.push(y);
        }
    }
    return viz[n];
}

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

	citire();
    while (BFS()) {
		for (int i = 0, t = graf[n].size(); i < t; i++) {
			int y = graf[n][i];
			int mini = capac[y][n] - flow[y][n];
			if (!viz[y]) continue;
            for (int last = y; last != 1; last = tat[last])
				mini = min(mini, capac[tat[last]][last] - flow[tat[last]][last]);
			if (mini < 0) cerr << "ERROR";
			else if (mini == 0) continue;
			else {
				flow[y][n] += mini;
				flow[n][y] -= mini;
				for (int last = y; last != 1; last = tat[last]) {
					flow[tat[last]][last] += mini;
					flow[last][tat[last]] -= mini;
				}
			}
			sol += mini;
		}
    }
    printf("%d", sol);

    return 0;
}