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

using namespace std;
typedef vector<int>::iterator iter;

#define INF 0x3f3f3f3f
#define MAXN 1005

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

int n;
int cap[MAXN][MAXN], f[MAXN][MAXN];
vector<int> G[MAXN];
bitset<MAXN> viz;
queue<int> q;
int t[MAXN];

bool bfs()
{
    viz.reset();
    q.push(1);
    viz[1] = true;

    while (!q.empty()) {
        int nd = q.front();
        q.pop();

        if (nd == n) {
            continue;
        }

        for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
            if (cap[nd][*it] == f[nd][*it] || viz[*it] == true) {
                continue;
            }
            viz[*it] = true;

            t[*it] = nd;
            q.push(*it);
        }
    }

    return viz[n];
}

int main()
{
    int m;
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        cap[x][y] = c;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    int flow = 0;
    while (bfs()) {
        for (iter it = G[n].begin(); it != G[n].end(); it++) {
            if (viz[*it] == false) {
                continue;
            }
            t[n] = *it;

            int fmin = INF;
            for (int i = n; i != 1; i = t[i]) {
                fmin = min(fmin, cap[t[i]][i] - f[t[i]][i]);
            }

            if (fmin) {
                for (int i = n; i != 1; i = t[i]) {
                    f[t[i]][i] += fmin;
                    f[i][t[i]] -= fmin;
                }
                flow += fmin;
            }
        }
    }

    fout << flow << '\n';

    fin.close();
    fout.close();
    return 0;
}