#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <algorithm>

using namespace std;

ifstream in("maxflow.in");
ofstream out("maxflow.out");

const int dim = 1005;

int n,m, sursa, destinatie;
long long int graf_rezidual[dim][dim];
vector<int> vec[dim];
queue<int> q;
long long int dist[dim];
int tata[dim];

int BFS() {
    for (int i=1; i<=n; i++) {
        dist[i] = LONG_LONG_MAX;
    }
    dist[sursa] = 0;
    q.push(sursa);
    tata[sursa] = -1;
    while (!q.empty()) {
        int x = q.front();
        q.pop();

        for (auto y:vec[x]) {
            if (graf_rezidual[x][y] > 0 && dist[y] > dist[x] + 1) {
                dist[y] = dist[x] + 1;
                tata[y] = x;
                q.push(y);
            }
        }
    }

    if (dist[destinatie] == LONG_LONG_MAX) return 0;
    return 1;
}

int main() {
    in >> n >> m;
    int x, y, c;
    sursa = 1;
    destinatie = n;
    while (m--) {
        in >> x >> y >> c;
        vec[x].push_back(y);
        vec[y].push_back(x);
        graf_rezidual[x][y] = c;
    }

    long long int maxflow = 0;
    long long int mini;
    while (BFS()) {
        mini = LONG_LONG_MAX;

        for (int j=destinatie; j != sursa; j = tata[j]) {
            mini = min(mini, graf_rezidual[tata[j]][j]);
        }

        maxflow += mini;

        for (int j=destinatie; j != sursa; j = tata[j]) {
            graf_rezidual[tata[j]][j] -= mini;
            graf_rezidual[j][tata[j]] += mini;
        }
    }

    out << maxflow;
    return 0;
}