#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;

int n, m;
int C[1001][1001], F[1001][1001];
vector<int> a[1001];
bool viz[1001];
int t[1001];
long long flowmax;

const int Inf = 1e9;

void read() {
    int i, x, y, cap;
    ifstream f("maxflow.in");
    f >> n >> m;
    for (i = 1; i <= m; i++) {
        f >> x >> y >> cap;
        C[x][y] += cap;
        a[x].emplace_back(y);
        a[y].emplace_back(x);
    }
    f.close();
}

queue<int> Q;

bool bfs() {
    int i, x, nod;
    for (i = 1; i <= n; i++)
        viz[i] = 0;
    viz[1] = 1;
    Q.push(1);
    while (!Q.empty()) {
        x = Q.front();
        Q.pop();
        if (x == n) continue;
        for (i = 0; i < a[x].size(); i++) {
            nod = a[x][i];
            if (viz[nod] || F[x][nod] == C[x][nod]) continue;
            viz[nod] = 1;
            t[nod] = x;
            Q.push(nod);
        }
    }
    if (viz[n])
        return 1;
    return 0;
}

void solve() {
    int i, nod, fmin, x;
    while (bfs()) {
        for (i = 0; i < a[n].size(); i++) {
            nod = a[n][i];
            if (!viz[nod] || F[nod][n] == C[nod][n]) continue;
            t[n] = nod;

            fmin = Inf;
            x = n;
            while (t[x]) {
                if (F[t[x]][x] < fmin)
                    fmin = C[t[x]][x] - F[t[x]][x];
                x = t[x];
            }

            if (fmin == 0) continue;

            x = n;
            while (t[x]) {
                F[t[x]][x] += fmin;
                F[x][t[x]] -= fmin;
                x = t[x];
            }
            flowmax += fmin;
        }
    }
}

void output() {
    ofstream g("maxflow.out");
    g << flowmax;
    g.close();
}

int main() {
    read();
    solve();
    output();
    return 0;
}