// Flux maxim

#include <fstream>
#include <vector>
#define MAXN 1111
#define INF 1<<30
using namespace std;
vector <int> vecini[MAXN];
int n,m,flux;
int c[MAXN][MAXN];
int f[MAXN][MAXN];
int t[MAXN],viz[MAXN],cd[MAXN];
inline int minim(int a,int b)
{
  if(a<b)
   return a;
  return b;
}
int bf()
{
    int i,j,k,nod,v;
    memset(viz, 0, sizeof(viz));
    k=1;
    cd[1]=1;
    viz[1]=1;
    for(i=1;i<=k;i++)
    {
     nod=cd[i];
     if(nod==n) continue;
     for(j=0;j<vecini[nod].size();j++)
     {
      v=vecini[nod][j];
      if(c[nod][v]==f[nod][v]||viz[v]) continue;
      viz[v]=1;
      cd[++k]=v;
      t[v]=nod;
     }
    }
    return viz[n];
}
int main()
{
    int i,x,y,cost,nod,flux_minim;
    ifstream in("maxflow.in");
    ofstream out("maxflow.out");
    in>>n>>m;
    for(i=1;i<=m;i++)
    {
     in>>x>>y>>cost;
     vecini[x].push_back(y);
     vecini[y].push_back(x);
     c[x][y]=cost;
    }
    while(bf())
    {
     for(i=0;i<vecini[n].size();i++)
     {
      nod=vecini[n][i];
      if(f[nod][n]==c[nod][n]|| !viz[nod]) continue;
      t[n]=nod;
      flux_minim=INF;
      for(nod=n;nod!=1;nod=t[nod])
       flux_minim=minim(flux_minim,c[t[nod]][nod]-f[t[nod]][nod]);
      if(!flux_minim) continue;
      flux+=flux_minim;
      for(nod=n;nod!=1;nod=t[nod])
      {
       f[t[nod]][nod]+=flux_minim;
       f[nod][t[nod]]-=flux_minim;
      }
     }
    }
    out<<flux<<"\n";
    return 0;
}