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

using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");

#define pb push_back
typedef long long ll;
const int NMax = 1e3 + 5;
const int inf = 1e9 + 5;

int N,M;
bool viz[NMax];
int dad[NMax],cap[NMax][NMax];
vector<int> v[NMax];

bool bfs();

int main() {
    in>>N>>M;
    for (int i=1;i<=M;++i) {
        int x,y,c;
        in>>x>>y>>c;
        if (!cap[x][y] && !cap[y][x]) {
            v[x].pb(y);
            v[y].pb(x);
        }

        cap[x][y] = c;
    }

    ll mxFlow = 0;
    while (bfs()) {
        for (int k=0;k < (int)v[N].size();++k) {
            int pre = v[N][k];

            if (!viz[pre] || !cap[pre][N]) {
                continue;
            }

            dad[N] = pre;
            int nod = N, mn = inf;
            while (nod != 1) {
                mn = min(mn, cap[dad[nod]][nod]);
                nod = dad[nod];
            }

            nod = N;
            while (nod != 1) {
                cap[dad[nod]][nod] -= mn;
                cap[nod][dad[nod]] += mn;
                nod = dad[nod];
            }

            mxFlow += mn;
        }
    }

    out<<mxFlow<<'\n';

    in.close();out.close();
    return 0;
}

bool bfs() {
    for (int i=2;i<=N;++i) {
        viz[i] = false;
    }
    viz[1] = true;

    queue<int> Q;
    Q.push(1);
    bool reachedN = false;
    while (Q.size()) {
        int nod = Q.front();
        Q.pop();
        if (nod == N) {
            reachedN = true;
            continue;
        }

        for (int k=0;k < (int)v[nod].size();++k) {
            int next = v[nod][k];
            if (viz[next] || !cap[nod][next]) {
                continue;
            }

            viz[next] = true;
            dad[next] = nod;
            Q.push(next);
        }
    }

    return reachedN;
}