#include <iostream>
#include <vector>
#include <map>
#include <queue>

using namespace std;

const long long INF = INT64_MAX;
int n, m;
map<int, long long> c[501], f[501];
vector<int> p, d;

bool bfs() {
    fill(d.begin(), d.end(), -1);
    queue<int> q;
    d[1] = 0;
    q.push(1);
    while(!q.empty()) {
        int v = q.front();
        q.pop();
        for (auto [to, flow] : f[v]) {
            if (flow < c[v][to] && d[to] == -1) {
                d[to] = d[v] + 1;
                q.push(to);
            }
        }
    }
    return d[n] != -1;
}

long long dfs(int i, long long flow){
    if(i == n){
        return flow;
    }
    for( ; p[i] <= n; ++p[i]){
        int to = p[i];
        if(d[to] == d[i] + 1 && c[i][to] - f[i][to] > 0) {
            long long delta = dfs(to, min(flow, c[i][to] - f[i][to]));
            if(delta > 0){
                f[i][to] += delta;
                f[to][i] -= delta;
                return delta;
            }
        }
    }
    return 0;
}

int main() {

    cin >> n >> m;
    p.resize(n + 1);
    d.resize(n + 1);

    for (int i = 0; i < m; ++i) {
        int from, to;
        long long cap;
        cin >> from >> to >> cap;
        c[from][to] += cap;
        f[from][to] = f[to][from] = 0;
    }

    long long ans = 0;
    while(bfs()) {
        fill(p.begin(), p.end(), 1);
        long long flow = dfs(1, INF);
        while (flow != 0) {
            ans += flow;
            flow = dfs(1, INF);
        }
    }

    cout << ans;

    return 0;
}