#include<cstdio>
#include<string>
#include<vector>
#include<deque>
#include<bitset>

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 INF = (1 << 30);
const int NMAX = 1000 + 5;

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

int bfs(int x) {
    viz = 0;

    viz[x] = 1;
    Q.push_back(x);

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

        if(x == sink)
            return 1;

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

    return viz[sink];
}

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

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    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(source))
        for(auto y : V[sink])
            if(F[y][sink] < C[y][sink] && 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;
}