#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int n, m;
vector <vector<int>> v, c;
vector <int> t;
vector <bool> visited;

void init() {
    v = vector <vector<int>> (n + 1);
    c = vector <vector<int>> (n + 1, vector <int> (n + 1));
    t = vector <int> (n + 1);
    visited = vector <bool> (n + 1);
}

void read() {
    fin >> n >> m;
    init();
    int x, y, cap;
    for(int i = 1; i <= m; i ++) {
        fin >> x >> y >> cap;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y] = cap;
    }
}

bool bfs() {
    queue <int> q;
    fill(visited.begin(), visited.end(), 0);
    q.push(1);
    visited[1] = true;
    int node;
    while(!q.empty()) {
        node = q.front();
        q.pop();
        if(node == n)
            return true;
        for(const auto& neighbour : v[node]) {
            if(visited[neighbour] || !c[node][neighbour])
                continue;
            t[neighbour] = node;
            visited[neighbour] = true;
            q.push(neighbour);
        }
    }
    return false;
}

int getMaxFlow() {
    int ansFlow = 0;
    while(bfs()) {
        int minFlow = 2e9;
        for (int node = n; node != 1; node = t[node]) {
            if (c[t[node]][node] < minFlow)
                minFlow = c[t[node]][node];
        }
        ansFlow += minFlow;
        for (int node = n; node != 1; node = t[node]) {
            c[t[node]][node] -= minFlow;
            c[node][t[node]] += minFlow;
        }
    }
    return ansFlow;
}


int main() {
    read();
    fout << getMaxFlow();
}