#include <bits/stdc++.h>

using namespace std;

#define int unsigned int

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

const int inf = (int)1e9 + 5;
const int max_n = (int)1e3 + 5;

int n, m;

int r[max_n][max_n];

vector<int> g[max_n];

bool visited[max_n];

int dad[max_n];

bool bfs() {
  for (int i = 1; i <= n; ++i) {
    visited[i] = false;
    dad[i] = -1;
  }
  queue<int> q;
  visited[1] = true;
  q.push(1);
  while ((int)q.size() > 0) {
    int u = q.front();
    q.pop();
    if (u == n) {
      continue;
    }
    for (int v : g[u]) {
      if (!visited[v] && r[u][v] > 0) {
        q.push(v);
        visited[v] = true;
        dad[v] = u;
      }
    }
  }
  return visited[n];
}

int32_t main() {
  in >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int u, v, c;
    in >> u >> v >> c;
    r[u][v] += c;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  int flow = 0;
  while (bfs() == true) {
    for (int v : g[n]) {
      if (v == n || !visited[v] || !r[v][n]) {
        continue;
      }
      dad[n] = v;
      int pmp = inf;
      for (int i = n; i != 1; i = dad[i]) {
        pmp = min(pmp, r[dad[i]][i]);
      }
      for (int i = n; i != 1; i = dad[i]) {
        r[dad[i]][i] -= pmp;
        r[i][dad[i]] += pmp;
      }
      flow += pmp;
    }
  }
  out << flow << "\n";
  return 0;
}