#include <bits/stdc++.h>

using namespace std;

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

vector <int> g[2001];
int n, m, a[1001][1001], viz[1001], tata[2001], flux_maxim, x, y, c;

bool bfs () {
  int viz[2001] = {0};
  queue <pair <int, int>> Q;

  Q.push({1, 1e9});
  viz[1] = 1;
  tata[1] = 0;
  while (!Q.empty()) {
    int nod = Q.front().first;
    int valoare = Q.front().second;
    Q.pop();

    for (int i : g[nod]) {
      if (viz[i] == 0 && a[nod][i] != 0) {
        tata[i] = nod;

        if (i == n) {
          return 1;
        }

        viz[i] = 1;

        int adaug = min(valoare, a[nod][i]);
        Q.push({i, adaug});
      }
    }
  }

  return 0;
}
int main () {


  fin >> n >> m;

  for (int i = 1; i <= m; i++) {
    fin >> x >> y >> c;
    g[x].push_back(y);
    g[y].push_back(x);
    a[x][y] = c;
  }

  while (bfs()) {
    int minim = 1e9;
    for (int i = n; i != 1; i = tata[i]) {
      minim = min(minim, a[tata[i]][i]);
    }

    for (int i = n; i != 1; i = tata[i]) {
      a[tata[i]][i] -= minim;
      a[i][tata[i]] += minim;
    }

    flux_maxim += minim;
  }

  fout << flux_maxim;

  return 0;
}