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

using namespace std;
typedef vector<int>::iterator iter;
#define max(a, b) (((a) < (b)) ? (a) : (b))

#define MAXN 1005
#define INF 0x3f3f3f3f

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

int cap[MAXN][MAXN];
int f[MAXN][MAXN];
int lst[MAXN * MAXN];
int t[MAXN];
int flow, n;
vector<int> G[MAXN];
bitset<MAXN> viz;

bool bfs()
{
    viz.reset();
    lst[0] = 1;
    viz[1] = true;

    for (int i = 0, len = 1; i < len; i++) {
        if (lst[i] != n) {
            int nd = lst[i];
            for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
                if (cap[nd][*it] != f[nd][*it] && !viz[*it]) {
                    viz[*it] = true;
                    t[*it] = nd;lst[len++] = *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);
    }

    while (bfs()) {
        for (iter it = G[n].begin(); it != G[n].end(); it++) {
            if (cap[*it][n] != f[*it][n] && viz[*it]) {
                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;
}