#include <iostream>
#include <cstdio>
#include <fstream>
#include <vector>
#include <bitset>
#include <cassert>
#include <queue>
#include <cstring>
#include <algorithm>
#define NMAX 1009
#define oo (1 << 30)
using namespace std;

int n, m, p[NMAX];;
vector<int> G[NMAX];
int flow[NMAX][NMAX], cap[NMAX][NMAX];
queue<int> Q;


void read_input() {
    cin >> n >> m;

    for (int i = 1; i <= m; ++i) {
        int x, y, c;
        cin >>  x >> y >> c;

        G[x].push_back(y);
        G[y].push_back(x);
        cap[x][y] += c;
    }
}

bool BFS(int source, int sink) {
    for (int i = 1; i <= n; ++i) {
        p[i] = oo;
    }

    Q.push(source);
    p[source] = 0;

    while (!Q.empty()) {
        int node = Q.front();
        Q.pop();

        if (node == sink) {
            continue;
        }

        for (auto it = G[node].begin(); it != G[node].end(); ++it) {
            int neighbour = *it;

            if (p[neighbour] == oo && flow[node][neighbour] < cap[node][neighbour]) {
                p[neighbour] = node;
                Q.push( neighbour );
            }
        }
    }

    return p[sink] != oo;
}

void MaxFlow(int source, int sink) {
    int maxFlow = 0;

    while (BFS(source, sink)) {
        for (auto it = G[sink].begin(); it != G[sink].end(); ++it) {
            if (p[*it] != oo && flow[*it][sink] < cap[*it][sink]) {
                p[sink] = *it;

                int minFlow = oo;
                for (int node = sink; node != source; node = p[node]) {
                    int parent = p[node],
                        available_flow = cap[ parent ][ node ] - flow[ parent ][ node ];

                    minFlow = min(minFlow, available_flow);
                }

                if (minFlow > 0) {
                    maxFlow += minFlow;

                    for (int node = sink; node != source; node = p[node]) {
                        int parent = p[node];
                        flow[ parent ][ node ] += minFlow;
                        flow[ node ][ parent ] -= minFlow;
                    }
                }
            }
        }
    }

    cout << maxFlow << "\n";
}

int main() {
    assert( freopen("maxflow.in", "r", stdin) != NULL);
    assert( freopen("maxflow.out", "w", stdout) != NULL) ;

    read_input();
    MaxFlow(1, n);
    return 0;
}