#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];

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()
{
   deque <int> Q;
   bool vis[NMAX] = {0};

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

   int u, w;

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

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

       if( !vis[w] && cap[u][w] > 0 && cap[u][w] > flow[u][w] )
       {
         parent[w] = u;

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

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

  return false;
}

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

   while( Bfs() )
   {
     curent_flow = INF;

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

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

     t_flow += curent_flow;
   }

  fout << t_flow << '\n';
}

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

    return 0;
}