using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
#define Nmax 1005
#define pb push_back
vector<int> G[Nmax];
ofstream fout("maxflow.out");
int C[Nmax][Nmax];
int F[Nmax][Nmax];
int viz[Nmax];
int ante[Nmax];
int N,M;
int BFS()
{vector<int>::iterator it;
queue<int> q;
int u;
    memset(viz,0,sizeof(viz));
    viz[1]=1;
    q.push(1);
    //cout<<"3";
    while(!q.empty())
    {   //cout<<"4";
        u=q.front();
        q.pop();
        for(it=G[u].begin();it!=G[u].end();++it)
        {  //cout<<u;
          if(viz[*it]==0)
           if(F[u][*it]<C[u][*it])
            {   //cout<<*it;
                viz[*it]=1;
                ante[*it]=u;
                q.push(*it);
                if(*it==N)
                return 1;
            }
        }
     // cout<<"\n";

    }
    return 0;

}

void solve()
{int i,flow,fmin;
//cout<<"2";
  for(flow=0;BFS();flow+=fmin)
  {//cout<<"ok";
      for(i=N;i!=1;i=ante[i])
      fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);
      for(i=N;i!=1;i=ante[i])
      {
          F[ante[i]][i]+=fmin;
          F[i][ante[i]]-=fmin;
      }

  }
  //cout<<"5";
  fout<<flow<<"\n";

}

void cit()
{int x,y,z,i;
    ifstream fin("maxflow.in");
    fin>>N>>M;
    for(i=1;i<=M;i++)

     {fin>>x>>y>>z;
     C[x][y]=z;
     F[y][z]=0;
     G[x].pb(y);
     G[y].pb(x);
     }
     fin.close();

}

int main()
{
    cit();
    memset(F,0,sizeof(F));
    //cout<<"1";
    solve();
    fout.close();
    return 0;
}