#include <bits/stdc++.h>
using namespace std;

const int NMAX = (int)1e3 * 5;
const int inf = (int)1e9;
int N,M,capacitate[1005][1005],flux_trimis[1005][1005],ans;
vector<int>ad[NMAX];
bool ok = true,b[1005];
inline void dfs (int node,int& mn) {
    //cout << node << ' ';
    b[node] = true;
    if (node == N) {
        //cout << mn << '\n';
        ans += mn;
        b[node] = 0;
        ok = true;
        return;
    }
    for (int i : ad[node])
        if ((capacitate[node][i] - flux_trimis[node][i] > 0) && b[i] == false) {
            int d = capacitate[node][i] - flux_trimis[node][i];
            mn = min(mn,d);
            dfs(i,mn);
            b[i] = 0;
            if (ok) {
                flux_trimis[i][node] += -mn;
                flux_trimis[node][i] += mn;
                b[node] = 0;
                return;
            }
        }
}
int main(){
    ios::sync_with_stdio(false);
	cin.tie(nullptr);

	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);
    cin >> N >> M;
    while (M--) {
        int u,v,c; cin >> u >> v >> c;
        ad[u].push_back(v);
        ad[v].push_back(u);
        capacitate[u][v] = c;
    }
    while (ok) {
        ok = false;
        int mn = inf;
        dfs(1,mn);
    }
    cout << ans;
    return 0;
}