#include <bits/stdc++.h>
 
using namespace std;
 
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

vector < vector < int > > residual;
vector < bool > viz;
vector < int > parent;

int n, m, hi;
bool BFS(int node) {
    viz.assign(n, false);
    queue < int > Q;

    parent[node] = -1;
    Q.push(node);
    viz[node] = true;
    while (!Q.empty()) {
        node = Q.front();
        Q.pop();

        for (int i = 0; i < n; ++i) {
            if (viz[i] == false && residual[node][i]) {
                Q.push(i);
                viz[i] = true;
                parent[i] = node;
            }
        }
    }

    return viz[n - 1];
}

int main() {
    ios::sync_with_stdio(false);

    fin >> n >> m;

    residual.resize(n);
    for (auto &x: residual) x.resize(n);

    for (int i = 0; i < m; ++i) {
        int a, b, c; 
        fin >> a >> b >> c;
        --a; --b;

        residual[a][b] += c;
    }

    int totalFlow = 0;
    viz.resize(n);
    parent.resize(n);
    while (BFS(0)) {
        int maxFlow = INT_MAX;
        for (int now = n - 1; now != 0; now = parent[now]) {
            int prev = parent[now];
            maxFlow = min(maxFlow, residual[prev][now]);
        }
        for (int now = n - 1; now != 0; now = parent[now]) {
            int prev = parent[now];
            residual[prev][now] -= maxFlow;
            residual[now][prev] += maxFlow;
        }

        totalFlow += maxFlow;
    }

    fout << totalFlow;
    return 0;
}