#include <bits/stdc++.h>
using namespace std;
void DAU(string const& task = "") {
    if (!task.empty())
        freopen((task + ".in").c_str(), "r", stdin),
        freopen((task + ".out").c_str(), "w", stdout);
    else
        ios::sync_with_stdio(false),
        cin.tie(0),
        cout.tie(0);
}
void PLEC() {
    exit(0);
}
using VI  = vector<int>;
using VVI = vector<VI>;
using VB  = vector<bool>;
const int INF = 1e9;
int n, m;
VVI g, C;
VB viz;
VI t;
inline void AddEdge(int const& x, int const& y, int const& c) {
    g[x].emplace_back(y);
    g[y].emplace_back(x);
    C[x][y] = c;
}
inline bool BF(int const& S, int const& D) {
    fill(viz.begin(), viz.end(), false);
    viz[S] = true;
    queue<int> q;
    q.emplace(S);
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        if (x == D)
            continue;
        for (int const& y : g[x])
            if (!viz[y] && C[x][y] > 0) {
                viz[y] = true;
                t[y] = x;
                q.emplace(y);
            }
    }
    return viz[D];
}
inline int MaxFlow(int const& S, int const& D) {
    int maxf = 0, fmin = INF;
    while (BF(S, D))
        for (const int& x : g[D]) {
            if (!viz[x] || C[x][D] <= 0)
                continue;
            t[D] = x;
            fmin = INF;
            for (int i = D; i != S; i = t[i])
                fmin = min(fmin, C[t[i]][i]);
            if (!fmin)
                continue;
            for (int i = D; i != S; i = t[i]) {
                C[t[i]][i] -= fmin;
                C[i][t[i]] += fmin;
            }
            maxf += fmin;
        }
    return maxf;
}
int main() {
    DAU("maxflow");
    cin >> n >> m;
    g = VVI(n + 1);
    C = VVI(n + 1, VI(n + 1));
    viz = VB(n + 1);
    t = VI(n + 1);
    while (m--) {
        int x, y, c;
        cin >> x >> y >> c;
        AddEdge(x, y, c);
    }
    cout << MaxFlow(1, n);
    PLEC();
}