#include <bits/stdc++.h>
using namespace std;

const int NMAX = 1024;

int n, m;
vector<int> adj[NMAX];
int cap[NMAX][NMAX];
int par[NMAX];

bool bfs(int src) {
  
  queue<int> q;
  q.push(src);
  fill(par + 1, par + n + 1, -1);
  
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : adj[u]) {
      if (v != 1 && par[v] == -1 && cap[u][v]) {
        par[v] = u;
        q.push(v);
      }
    }
  }

  return par[n] != -1;
}

void solve() {
  
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v, f;
    cin >> u >> v >> f;
    adj[u].push_back(v);
    adj[v].push_back(u);
    cap[u][v] = f;
  }

  int F = 0;

  while (bfs(1)) {

    int max_cap = INT_MAX;
    for (int u = n; u != 1; u = par[u]) max_cap = min(max_cap, cap[par[u]][u]);
    for (int u = n; u != 1; u = par[u]) cap[par[u]][u] -= max_cap;

    F += max_cap;
  }

  cout << F << '\n';  
}


int main() {

  #ifdef LOCAL
  freopen("file.in", "r", stdin);
  #else
  freopen("maxflow.in", "r", stdin);
  freopen("maxflow.out", "w", stdout);
  #endif

  ios_base::sync_with_stdio(false), cin.tie(NULL);

  solve();
}