#include <queue>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX = 1005;
const int INF = 0x7fffffff;
vector <int> g[NMAX];
int cap[NMAX][NMAX];
bool viz[NMAX];
int deUnde[NMAX];
int minim;
bool bfs(int nod, int n) {
  queue <int> q;
  q.push(nod);
  minim = INF;
  while(!q.empty()) {
    int u = q.front();
    minim = min(minim, cap[deUnde[u]][u]);
    viz[u] = 1;
    q.pop();
    for(auto v : g[u]) {
      if(cap[u][v] > 0 && !viz[v]) {
        deUnde[v] = u;
        q.push(v);
      }
    }
  }
  return viz[n] == true;
}
void init(int n) {
  for(int i = 1; i <= n; i++) {
    viz[i] = 0;
  }
}

int main() {
  int n, m;
  freopen("maxflow.in", "r", stdin);
  freopen("maxflow.out", "w", stdout);
  scanf("%d%d", &n, &m);
  for(int i = 1; i <= m; i++) {
    int x, y, c;
    scanf("%d%d%d", &x, &y, &c);
    g[x].push_back(y);
    g[y].push_back(x);
    cap[x][y] = c;
    cap[y][x] = 0;
  }
  int sol = 0;
  cap[0][1] = INF;
  while(bfs(1, n)) {
    init(n);
    int poz = n;
    while (poz != 1) {
      cap[deUnde[poz]][poz] -= minim;
      cap[poz][deUnde[poz]] += minim;
      poz = deUnde[poz];
    }
    sol += minim;
  }
  printf("%d\n", sol);
  return 0;
}