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

const int nmax = 1007;

int n, m;
vector<int> adj[nmax];
int cap[nmax][nmax];
int par[nmax];

void bfs() {

  queue<int> q;
  q.push(1);
  par[1] = -1;

  while (!q.empty()) {
    int u = q.front(); q.pop();
    for (int v : adj[u]) {
      if (cap[u][v] > 0 && par[v] == 0) {
        par[v] = u;
        if (v != n) q.push(v);
      }
    }
  }
}

int solve() {

  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    int u, v, c;
    cin >> u >> v >> c;
    adj[u].push_back(v);
    adj[v].push_back(u);
    cap[u][v] += c;
  }

  int totalFlow = 0;

  for (;;) {

    memset(par, 0, sizeof(par));

    bfs();

    if (par[n] == 0) return totalFlow;

    for (int v : adj[n]) {

      if (cap[v][n] == 0) continue;

      par[n] = v;

      int currentFlow = INT_MAX;

      for (int u = n; u != 1; u = par[u]) {
        currentFlow = min(currentFlow, cap[par[u]][u]);
      }

      if (currentFlow == 0) continue;

      for (int u = n; u != 1; u = par[u]) {
        cap[par[u]][u] -= currentFlow;
        cap[u][par[u]] += currentFlow;
      }

      totalFlow += currentFlow;

    }
  }

}

int main() {

  freopen("maxflow.in", "r", stdin);
  freopen("maxflow.out", "w", stdout);

  cout << solve() << endl;
}