#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 1005

using namespace std;

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

int n, m, fMax = 0;
int c[nmax][nmax], f[nmax][nmax], t[nmax];
bool viz[nmax];
vector <int> G[nmax];
queue <int> q;

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

int bfs() {
    
    for (int i = 1; i <= n; i++)
        viz[i] = 0;
    
    viz[1] = 1;
    q.push(1);
    
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        if (nod == n) continue;
        for (int i = 0; i < G[nod].size(); i++) {
            int vecin = G[nod][i];
            if (viz[vecin] || c[nod][vecin] == f[nod][vecin]) continue;
            t[vecin] = nod;
            viz[vecin] = true;
            q.push(vecin);
        }
    }
    
    return viz[n];
    
}

void solve() {
    while (bfs()) {
        for (int i = 0; i < G[n].size(); i++) {
            int vecin = G[n][i];
            if (!viz[vecin] || c[vecin][n] == f[vecin][n]) continue;
            
            t[n] = vecin;
            
            int fMin = 110005;
            
            for (int nod = n; nod != 1; nod = t[nod])
                if (fMin > c[t[nod]][nod] - f[t[nod]][nod])
                    fMin = c[t[nod]][nod] - f[t[nod]][nod];
            
            if (fMin == 0) continue;
            
            fMax += fMin;
            
            for (int nod = n; nod != 1; nod = t[nod])
                f[t[nod]][nod] += fMin,
                f[nod][t[nod]] -= fMin;
        }
    }
    fout << fMax << "\n";
}

int main() {
    
    read();
    solve();
    
    fin.close();
    fout.close();
    
    return 0;
}