#include <fstream>
#include <bitset>
#include <vector>
#include <queue>

using namespace std;
const int NMAX = 1002;
const int MMAX = 5002;
const int INF = 21e8;

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

int n;
int cap[NMAX][NMAX]; ///capacitatea init
int adj[NMAX][NMAX];
int viz[NMAX], tata[NMAX];

bool bfs() {
    for(int nod = 1; nod <= n; nod++)
        viz[nod] = tata[nod] = 0;
    viz[1] = 1;
    queue <int> q;
    q.push(1);
    while(!q.empty()) {
        int start = q.front();
        q.pop();
        for(int nod = 1; nod <= n; nod++) {
            if((!viz[nod]) && adj[start][nod] < cap[start][nod]) { ///adica mai avem ce sa pompam
                tata[nod] = start;
                viz[nod] = 1;
                q.push(nod);
            }
        }
    }
    return viz[n];
}
int recons(int nod) {
    tata[n] = nod;
    nod = n; ///ca sa incepem de la ult
    int minn = INF;
    while(nod != 1) {
        int val = cap[tata[nod]][nod] - adj[tata[nod]][nod];
        if(val <= 0)
            return -1;
        minn = min(minn, val);
        nod = tata[nod];
    }
    return minn;
}
void update(int nod, int add) {
    nod = n;
    while(nod != 1) {
        adj[tata[nod]][nod] += add;
        if(nod != n) ///!!!!!!
            adj[nod][tata[nod]] -= add; ///pe inversa
        nod = tata[nod];
    }
}

int main()
{
    int m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int a, b, cost;
        cin >> a >> b >> cost;
        cap[a][b] += cost;
    }
    int flux = 0;
    while(bfs()) { ///cat timp mai POT sa pompez flux
        for(int i = 1; i < n; i++){
            if(viz[i] && adj[i][n] < cap[i][n]) { ///se mai poate
                int add = recons(i);
                if(add != -1) {
                    flux += add;
                    update(i, add);
                }
            }
        }
    }
    cout << flux;
    return 0;
}