#include <bits/stdc++.h>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

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

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
#define pb push_back
const int NMax = 1e3 + 5;
const int inf = 1e9 + 5;
const int mod = 9973;
using zint = int;

int N,M;
bool vis[NMax];
int cap[NMax][NMax], dad[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] == 0 && cap[y][x] == 0) {
            v[x].pb(y);
            v[y].pb(x);
        }

        cap[x][y] = c;
    }

    int maxFlow = 0;
    while (bfs()) {
        for (int nxt : v[N]) {
            if (cap[nxt][N] == 0 || !vis[nxt]) {
                continue;
            }
            dad[N] = nxt;

            int minFlow = inf, node = N;
            while (node != 1) {
                minFlow = min(minFlow, cap[dad[node]][node]);
                node = dad[node];
            }

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

            maxFlow += minFlow;
        }
    }

    out<<maxFlow<<'\n';

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

bool bfs() {
    memset(vis, 0, N+1);
    /*
    for (int i = 1;i <= N;++i) {
        vis[i] = false;
    }
    //*/

    queue<int> Q;
    Q.push(1);
    bool reachedN = false;
    while (Q.size()) {
        int node = Q.front();
        Q.pop();

        if (node == N) {
            reachedN = true;
            continue;
        }

        for (int nxt : v[node]) {
            if (vis[nxt] || !cap[node][nxt]) {
                continue;
            }
            vis[nxt] = true;

            dad[nxt] = node;
            Q.push(nxt);
        }
    }

    return reachedN;
}