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

using namespace std;

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

const int NMAX = 355;
const int INF = 2000000000;

int N, M;
int source, sink;

vector <int> Ad[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;

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

    cap[x][y] = c;
  }

  fin.close();
}

bool Bfs()
{
  bool vis[NMAX] = { 0 };
  deque <int> Q;

  int u, w;

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

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

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

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

      parent[w] = u;
      vis[w] = true;
      Q.push_back( w );

      if( w == N ) return true;
    }
  }

  return false;
}

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

  while( Bfs() )
  {
    curent_flow = -INF;

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

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

    max_flow += curent_flow;
  }

  fout << max_flow << '\n';
}

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

    return 0;
}