#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int> v[1024];
int n, m, i, j, fmin, fmax, viz[1024], c[1024][1024], f[1024][1024], nod, t[1024], a, b, ca, nodd;
queue <int> q;

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

int main(){
    fin >> n >> m;
    for (i = 1; i <= m; i++){
        fin >> a >> b >> ca;
        v[a].push_back(b);
        v[b].push_back(a);
        c[a][b] = ca;
    }
    fmax = 0;
    while(bfs()){
        for (j = 0; j < v[n].size(); j++){
            nodd = v[n][j];
            if (viz[nodd] == 1 and c[nodd][n] != f[nodd][n]){
                t[n] = nodd; fmin = 99999999;
                nodd = n;
                while (nodd != 1){
                    fmin = min(fmin, c[t[nodd]][nodd] - f[t[nodd]][nodd]);
                    nodd = t[nodd];
                }

                nodd = n;
                while (nodd != 1){
                    f[t[nodd]][nodd] += fmin;
                    f[nodd][t[nodd]] -= fmin;
                    nodd = t[nodd];
                }
                fmax += fmin;

            }
        }
    }
    fout << fmax << '\n';
}