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

const int nmax = 357;
const int inf = 0x3f3f3f3f;

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

void bellmanFord() {

  memset(dist, inf, sizeof(dist));
  memset(par, -1, sizeof(par));

  dist[1] = 0;
  par[1] = 0;

  for (int _ = 1; _ <= n; _++) {
    for (int u = 1; u <= n; u++) {
      for (int v : adj[u]) {
        if (cap[u][v] > 0 && dist[u] + cost[u][v] < dist[v]) {
          dist[v] = dist[u] + cost[u][v];
          par[v] = u;
        }
      }
    }
  }

}

int solve() {

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

  int totalFlow = 0;

  for (;;) {

    bellmanFord();

    if (par[n] == -1) return totalFlow;

    int currentFlow = INT_MAX;

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

    if (currentFlow == 0) return totalFlow;

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

    totalFlow += currentFlow;

  }

  return totalFlow;
}

int main() {

  #ifdef LOCAL
  freopen("file.in", "r", stdin);
  #else
  freopen("maxflow.in", "r", stdin);
  freopen("maxflow.out", "w", stdout);
  #endif

  cout << solve() << endl;

}