//Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow
//O(VE^2)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");

int N,M,source;
vector<vector <int>> graph;
vector<bool> visited;
vector<int> parent;
queue<int> q;
vector<vector<int>> residual;

int bfs (int node) {

    fill(visited.begin(), visited.end(), 0);


    visited[node] = 1;

    q.push(node);

    while (!q.empty()) {

        int nod_curent = q.front();
        q.pop();

        for (auto i:graph[nod_curent]) {
            if (i!=N && !visited[i] && residual[nod_curent][i]>0) {
                visited[i] = 1;
                q.push(i);
                parent[i] = nod_curent;
            }
        }
    }

    int max_flow = 0;
  
    for (auto i : graph[N]) {
        if (!visited[i])
            continue;
        int min_flow = residual[i][N];
        int aux = i;

        while (aux != 1) {
            min_flow = min(min_flow, residual[parent[aux]][aux]);
            aux = parent[aux];
        }

        residual[N][i] += min_flow;
        residual[i][N] -= min_flow;
        aux = i;

        while (aux != 1) {
            residual[aux][parent[aux]] += min_flow;
            residual[parent[aux]][aux] -= min_flow;
            aux = parent[aux];
        }

        max_flow += min_flow;
    }

    return max_flow;
}

int get_max_flow(){

    int ans = 0;
    int augumented_path = bfs(source);

    while (augumented_path) {
        ans += augumented_path;
        augumented_path = bfs(source);
    }

    return ans;
}

int main ()
{
    f>>N>> M;
    graph.resize(N+1);
    visited.resize(N+1,0);
    residual.resize(N+1, vector<int>(N+1, 0));
    parent.resize(N+1, -1);
    source = 1;
    for (int i=0; i<M; i++) {
        int x,y,z;
        f>> x >> y >> z;
        graph[x].push_back(y);
        graph[y].push_back(x);
        residual[x][y] += z;
    }
    g<<get_max_flow();
    return 0;
}