#include <fstream>
#include <vector>
#include <queue>
#include <cstring>

using namespace std;

int n, m, f[1005][1005], c[1005][1005], fiu[1005];
bool ok[1005];
vector<int> v[1005];

bool bfs()
{
    memset(ok, 0, sizeof(ok));
    queue<int> q;
    q.push(1);
    ok[1] = 1;
    while(!q.empty()){
        int k = q.front();
        q.pop();
        for (unsigned i = 0; i < v[k].size(); ++i)
            if(f[k][v[k][i]] != c[k][v[k][i]] && !ok[v[k][i]]){
                fiu[v[k][i]] = k;
                ok[v[k][i]] = 1;
                q.push(v[k][i]);
                if(v[k][i] == n)
                    return 1;
            }
    }
    return 0;
}

int main()
{
    ifstream fin ("maxflow.in");
    ofstream fout ("maxflow.out");
    fin >> n >> m;
    while(m--){
        int x, y, z;
        fin >> x >> y >> z;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y] = z;
    }
    int flow = 0;
    while(bfs()){
        for (unsigned j = 0; j < v[n].size(); ++j)
            if(f[v[n][j]][n] != c[v[n][j]][n] && ok[v[n][j]]){
                int fmin = 2000000000;
                fiu[n] = v[n][j];
                for(int i = n; i != 1; i = fiu[i])
                    fmin = min(fmin, c[fiu[i]][i] - f[fiu[i]][i]);
                if(fmin == 0)
                    continue;
                for(int i = n; i != 1; i = fiu[i]){
                    f[fiu[i]][i] += fmin;
                    f[i][fiu[i]] -= fmin;
                }
                flow += fmin;
            }
    }
    fout << flow << "\n";
    fin.close();
    fout.close();
    return 0;
}