#include <bits/stdc++.h>
#define oo 0x3f3f3f3f

using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n, m;
vector<int> graf[1001];
int c[1001][1001], flow[1001][1001], parent[1001];
bool viz[1001];

void read()
{
  f>>n>>m;
  int x, y;
  for(int i = 1;i <= m;++i)
    f>>x>>y, f>>c[x][y], graf[x].push_back(y), graf[y].push_back(x);
}

bool bfs()
{
  memset(viz, false, sizeof(viz));
  queue<int> q;
  q.push(1);

  while(!q.empty())
  {
    int node = q.front();
    q.pop();

    if(node == n) continue;

    for(int vecin : graf[node])
      {
        if(viz[vecin] || c[node][vecin] == flow[node][vecin]) continue;
        viz[vecin] = true;
        q.push(vecin);
        parent[vecin] = node;
      }
  }
  return viz[n];
}

void solve()
{
  int max_flow = 0;
  while(bfs())
  {
    for(int vecin : graf[n])
      {
        if(!viz[vecin] || c[vecin][n] == flow[vecin][n]) continue;

        parent[n] = vecin;

        int fl = oo;
        for(int node = n;node != 1;node = parent[node])
          fl = min(fl, c[parent[node]][node] - flow[parent[node]][node]);
      
        if(!fl) continue;

        for(int node = n;node != 1;node = parent[node])
          flow[parent[node]][node] += fl, flow[node][parent[node]] -= fl;
        
        max_flow += fl;
      }
  }
  g<<max_flow;
}

int main()
{
  read();
  solve();
  return 0;
}