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;
queue<int> q;
int BFS()
{vector<int>::iterator it;

int u;
    while(!q.empty())
     q.pop();
    memset(viz,0,sizeof(viz));
    viz[1]=1;
    q.push(1);

    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(it=G[u].begin();it!=G[u].end();++it)
        {
          if(viz[*it]==0)
           if(F[u][*it]<C[u][*it])
            {
                viz[*it]=1;
                ante[*it]=u;
                q.push(*it);
                if(*it==N)
                return 1;
            }
        }


    }
    return 0;

}

void solve()
{int i,flow,fmin;

  for(flow=0;BFS();flow+=fmin)
  {
      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;
      }

  }
  fout<<flow<<"\n";

}

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

     {fin>>x>>y>>z;
         //scanf("%d%d%d",&x,&y,&z);
     C[x][y]+=z;
     F[y][z]=0;
     G[x].pb(y);
     G[y].pb(x);
     }
    fin.close();

}

int main()
{ //freopen("maxflow.in","r",stdin);
    cit();
    solve();
    fout.close();
    return 0;
}