#include <fstream>
#include <vector>
#include <deque>

using namespace std;

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

const int NMAX = 1005;
const int INF = 2000000000;

int N, M;

vector <int> Ad[NMAX];
bool vis[NMAX];

int cap[NMAX][NMAX];
int flow[NMAX][NMAX];
int parent[NMAX];

void Read()
{
  fin >> N >> M;

  int x, y, c;
  for( int i = 1; i <= M; ++i )
  {
    fin >> x >> y >> c;

    cap[x][y] = c;

    Ad[x].push_back(y);
    Ad[y].push_back(x);
  }

  fin.close();
}

bool Bfs()
{
  for( int i = 1; i <= N; ++i )
    vis[i] = 0;

  deque <int> Q;

  Q.push_back( 1 );
  vis[1] = 1;

  int u, w;
  while( !Q.empty() )
  {
    u = Q.front();
    Q.pop_front();

    if( u == N ) continue;

    for( int i = 0; i < Ad[u].size(); ++i )
    {
      w = Ad[u][i];

      if( flow[u][w] == cap[u][w] || vis[w] ) continue;

      parent[w] = u;
      vis[w] = 1;

      Q.push_back( w );
    }
  }

  return vis[N];
}

void Do()
{
  int max_flow = 0;
  int curent_flow;
  int nod;

  while( Bfs() )
  {
    for( int i = 0; i < Ad[N].size(); ++i )
    {
      nod = Ad[N][i];
      if( flow[nod][N] == cap[nod][N] || !vis[nod] ) continue;

      parent[N] = nod;
      curent_flow = INF;

      for( nod = N; nod != 1; nod = parent[nod] )
        curent_flow = min( curent_flow, cap[ parent[nod] ][nod] - flow[ parent[nod] ][nod] );

      for( nod = N; nod != 1; nod = parent[nod] )
      {
        flow[ parent[nod] ][nod] += curent_flow;
        flow[nod][ parent[nod] ] -= curent_flow;
      }

      max_flow += curent_flow;
    }
  }

  fout << max_flow << '\n';

  fout.close();
}

int main()
{
    Read();
    Do();

    return 0;
}