#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "maxflow";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 1000 + 5;
const int INF = (1LL << 30) - 1;

int N, M;
int C[NMAX][NMAX];
int F[NMAX][NMAX];
int source, sink, maxflow;
vector<int> V[NMAX];
deque<int> Q;
bitset<NMAX> viz;
int dad[NMAX];

int bfs() {
    int x;

    Q.clear();
    viz = 0;
    Q.push_back(source);

    while(!Q.empty()) {
        x = Q.front();
        Q.pop_front();

        if(x == sink)
            continue;

        for(auto y : V[x])
            if(!viz[y] && F[x][y] < C[x][y]) {
                dad[y] = x;
                viz[y] = 1;
                Q.push_back(y);
            }
    }

    return viz[sink];
}

int main() {
    int x, y, z, v;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    while(M--) {
        scanf("%d%d%d", &x, &y, &z);
        C[x][y] = z;
        V[x].push_back(y);
        V[y].push_back(x);
    }

    source = 1;
    sink = N;

    while(bfs())
        for(auto y : V[sink])
            if(viz[y]) {
                dad[sink] = y;

                v = INF;

                for(x = sink; x != source; x = dad[x])
                    v = min(v, C[dad[x]][x] - F[dad[x]][x]);

                for(x = sink; x != source; x = dad[x]) {
                    F[dad[x]][x] += v;
                    F[x][dad[x]] -= v;
                }

                maxflow += v;
            }

    printf("%d\n", maxflow);

    return 0;
}