#include <iostream>
#include <cstdio>
#include <vector>
#define NMAX 1000
#define MMAX 5000
#define INF 550000000

using namespace std;

bool uz[NMAX + 5][NMAX + 5];
int n, m, flux_tot, flux;
int cflux[NMAX + 5][NMAX + 5], cap[NMAX + 5][NMAX + 5];

void dfs(int nod, int cf) {
  if(nod == n) {
    flux = cf;
    return;
  }
  for(int i = 2; i <= n; i++) {
    if(i == nod || uz[nod][i] || cap[nod][i] - cflux[nod][i] == 0)
      continue;
    uz[nod][i] = true;
    dfs(i, min(cf, cap[nod][i] - cflux[nod][i]));
    if(flux) {
      cflux[nod][i] += flux;
      cflux[i][nod] -= flux;
      return;
    }
  }
}

int main() {
  freopen("maxflow.in", "r", stdin);
  freopen("maxflow.out", "w", stdout);
  int x, y, z;

  scanf("%d %d", &n, &m);
  for(int i = 1; i <= m; i++) {
    scanf("%d %d %d", &x, &y, &z);
    cap[x][y] = z;
  }

  flux = 1;
  while(flux) {
    flux = 0;
    for(int i = 1; i <= n; i++)
      for(int j = 1; j <= n; j++)
        uz[i][j] = false;
    dfs(1, INF + 5);
    flux_tot += flux;
  }

//  for(int i = 1; i <= n; i++)
//    for(muchie vec: v[i])
//      printf("muchia (%d, %d) are flux %d/%d\n", i, vec.nod, vec.flux, vec.cap);

  printf("%d", flux_tot);

  return 0;
}