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

using namespace std;

bool dest;
int n, m, flux_tot, flux;
int f[NMAX + 5][NMAX + 5], c[NMAX + 5][NMAX + 5];
int from[NMAX + 5], mincf[NMAX + 5];
vector<int> v[NMAX + 5];

void update_flux(int nod, int flux) {
  if(nod == 1)
    return;
  update_flux(from[nod], flux);
  f[from[nod]][nod] += flux;
  f[nod][from[nod]] -= flux;
  mincf[nod] = min(c[from[nod]][nod] - f[from[nod]][nod], mincf[from[nod]]);
}

void dfs(int nod) {
  if(nod == 1)
    mincf[1] = INF + 5;
  else
    mincf[nod] = min(c[from[nod]][nod] - f[from[nod]][nod], mincf[from[nod]]);
  if(nod == n) {
    flux_tot += mincf[n];
    update_flux(n, mincf[n]);
    from[n] = 0;
    dest = true;
    return;
  }
  for(int x: v[nod]) {
    if(c[nod][x] - f[nod][x] == 0 || from[x])
      continue;
    from[x] = nod;
    dfs(x);
  }
}

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);
    c[x][y] = z;
    v[x].push_back(y);
    v[y].push_back(x);
  }

  dest = true;
  while(dest) {
    for(int i = 1; i <= n; i++)
      from[i] = 0;
    dest = false;
    dfs(1);
  }

//  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;
}