#include <iostream>
#include <vector>
#include <climits>
#include <cstring>
using namespace std;
 
int n,m;
 
bool vis[1024];
int p[1024];
vector<int> v[1024];
int maxCap[1024][1024];
int usedCap[1024][1024];
int q[1024];

long sum;
int main()
{
	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);
  scanf("%d %d",&n,&m);
  for(int i=0;i<m;i++)
  {
    int j,k,c;
    scanf("%d %d %d",&j,&k,&c);
    v[j].push_back(k);
    v[k].push_back(j);
 
    maxCap[j][k]+=c;
  }
  while(true)
  {	
	  memset(vis, 0, sizeof(vis));
    q[0]=1;
    q[1]=1;
    vis[1]=true;
    for(int i=1;i<=q[0];i++)
    {
      int tp= q[i];
      if(tp==n) continue;
      for(int j=0; j<v[tp].size();++j )
      {
        int it=v[tp][j];
        if(!vis[(it)]&&usedCap[tp][(it)]<maxCap[tp][(it)])
        {
      //    cout<<":"<<*it<<" ";
          q[++q[0]]=it;
          vis[it]=true;
          p[it]=tp;
        }
        
    //  cout<<"\n"<<tp<<"\n";
      }
    }
  //  cout<<low<<" done\n";
    if(vis[n])
    {
      for(int j=0;j<v[n].size();j++)
      {
        int currentN= v[n][j];
        if(maxCap[currentN][n]==usedCap[currentN][n]|| !vis[currentN]) continue;
        int low=INT_MAX;
        for(int nod=n;nod!=1;nod=p[nod])
          low= min(low,maxCap[p[nod]][nod]-usedCap[p[nod]][nod]);
        if(low==0) continue;
        sum+=low;
        for(int nod=n;nod!=1;nod=p[nod])
        {
          usedCap[p[nod]][nod]+=low;
          usedCap[nod][p[nod]]-=low;
        }
      }
    }
    else break;
  }
  printf("%ld\n",sum);
}