#include <bits/stdc++.h>
#define Nmax 1005
#define INF 200000
using namespace std;

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

int N, M;
vector<int> G[Nmax];
bool vis[Nmax];
int f[Nmax][Nmax], c[Nmax][Nmax], father[Nmax], Min[Nmax];
queue<int> Q;

int MakeFlow() {
    memset(vis, 0, sizeof(vis));
    Min[1] = INF;
    while (!Q.empty()) Q.pop();
    Q.push(1);
    vis[1] = 1;

    while (!Q.empty()) {
        int curr = Q.front();
        Q.pop();
        for (auto nxt: G[curr])
        if (f[curr][nxt] < c[curr][nxt] && !vis[nxt]) {
           father[nxt] = curr;
           vis[nxt] = 1;
           Min[nxt] = min(Min[curr], c[curr][nxt] - f[curr][nxt]);
            if (nxt != N) Q.push(nxt);
            else {
                curr = N;
                while (curr != 1) {
                    int prev = father[curr];
                    f[prev][curr] += Min[N], f[curr][prev] -= Min[N];
                    curr = prev;
                }
                 return Min[N];
            }
    }
    }
    return 0;
}
int main()
{
    fin >> N >> M;
    for (int i = 1; i <= M; ++i) {
        int x, y, z;
        fin >> x >> y >> z;
        c[x][y] = z;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    int ans = 0;
    bool ok = 1;
    while (ok) {
        int res = MakeFlow();
        if (res) ans += res;
        else ok = 0;
    }
       fout << ans << '\n';
    return 0;
}