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

ifstream cin("maxflow.in");
ofstream cout("maxflow.out");

const int EDGEMAX = 5e4 + 3;
const int NMAX = 1e4 + 3;
const int INF = 1e9;

struct edge {
    
    int vec, cap;
}e[2 * EDGEMAX];

vector<int> adj[NMAX];
int level[NMAX], ptr[NMAX], flow;
queue<int> q;

bool bfs(int& source, int& dest, int& n) {
    
    for(int i = 1; i <= n; i++)
        level[i] = ptr[i] = 0;
    level[source] = 1;
    queue<int>().swap(q);
    q.push(source);
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        for(auto i : adj[x])
            if(!level[e[i].vec] && e[i].cap) {
                level[e[i].vec] = level[x] + 1;
                q.push(e[i].vec);
            }
    }
    return level[dest];
}

int push(int x, int& dest, int minflow) {
    
    if(x == dest) {
        flow += minflow;
        return minflow;
    }
    for(auto i = adj[x].begin() + ptr[x]; i != adj[x].end(); ptr[x]++, i++)
        if(level[e[*i].vec] == level[x] + 1 && e[*i].cap) {
            int flux = push(e[*i].vec, dest, min(minflow, e[*i].cap));
            if(flux) {
                e[*i].cap -= flux, e[(*i) ^ 1].cap += flux;
                return flux;
            }
        }
    return 0;
}

void dinic(int source, int dest, int n) {
    
    while(bfs(source, dest, n))
        while(push(source, dest, INF));
}

int main() {
    
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < 2 * m; i += 2) {
        int x, y, z;
        cin >> x >> y >> z;
        adj[x].push_back(i);
        adj[y].push_back(i + 1);
        e[i] = {y, z}, e[i + 1] = {x, 0};
    }
    dinic(1, n, n);
    cout << flow;
    return 0;
}