#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int> v[1001];
queue <int> q;
int cost[1001], c[1001][1001], f[1001][1001], t[1001];
int n, m, i, j, a, b, co, flow, fmin;


int bfs(int st){
    int i, j;
    while (!q.empty())
        q.pop();
    for (i = 1; i <= n; i++)
        cost[i] = -1;
    cost[st] = 1; q.push(st);
    while (!q.empty()){
        int nod = q.front(); q.pop();
        for (i = 0; i < v[nod].size(); i++)
            if (cost[v[nod][i]] == -1 and c[nod][v[nod][i]] != f[nod][v[nod][i]]){
                cost[v[nod][i]] = 1;
                t[v[nod][i]] = nod;
                if (v[nod][i] == n)
                    return 1;
                q.push(v[nod][i]);
            }
    }
    return 0;
}

int main(){
    fin >> n >> m;
    for (i = 1; i <= m; i++){
        fin >> a >> b >> co;
        v[a].push_back(b);
        v[b].push_back(a);
        c[a][b] = co;
    }
    while (bfs(1)){
        for (i = 0; i < v[n].size(); i++)
            if (c[v[n][i]][n] != f[v[n][i]][n])
                t[n] = v[n][i];
        int nod = n;
        int fmin = 99999;
        while (nod != 1){
            fmin = min(fmin, c[t[nod]][nod] - f[t[nod]][nod]);
            nod = t[nod];
        }
        nod = n;
        while (nod != 1){
            f[t[nod]][nod] += fmin;
            f[nod][t[nod]] -= fmin;
            nod = t[nod];
        }
        flow += fmin;
    }
    fout << flow << " ";
    fin.close();
    fout.close();
}