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

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, z;
    scanf("%d%d%d", &x, &y, &z);
    cap[x][y] = z;
    vec[x].push_back(y);
    vec[y].push_back(x);
  }
  int sol = 0;
  while(bfs(1, n) == 1) {
    for(int v : vec[n]) {
      if(viz[v] == 1) {
        deUnde[n] = v;
        int poz = n;
        int minim = INF;
        while(poz != 1) {
          minim = min(minim, cap[deUnde[poz]][poz]);
          poz = deUnde[poz];
        }
        poz = n;
        while(poz != 1) {
          cap[deUnde[poz]][poz] -= minim;
          cap[poz][deUnde[poz]] += minim;
          poz = deUnde[poz];
        }
        sol += minim;
      }
    }
    for(int i = 1; i <= n; i++) {
      viz[i] = 0;
    }
  }
  printf("%d\n", sol);
  return 0;
}