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 dim=8192;
char ax[8192];
int pz;
//ofstream fout("poly.out");
inline void cit(int &x)
{
    x = 0;
    while(ax[pz] < '0' || ax[pz] > '9')
	if(++pz == dim) fread(ax,1, dim, stdin),pz = 0;

    while(ax[pz] >= '0' && ax[pz] <= '9')
    {
	x = x * 10 + ax[pz] - '0';
	if(++pz == dim) fread(ax,1,dim,stdin),pz = 0;
    }
}
int BFS()
{
int qu[1005];
int u,i,V;
    //while(!q.empty())
     //q.pop();
    memset(viz,0,sizeof(viz));
    viz[1]=1;
    //q.push(1);
    qu[0]=1;
    qu[1]=1;
    int alfa=1;

    while(alfa<=qu[0])
    {
        u=qu[alfa];
        //q.pop();
        alfa++;
        //for(it=G[u].begin();it!=G[u].end();++it)
        for(i=0;i<G[u].size();i++)
        { V=G[u][i];
          if(viz[V]==0)
           if(F[u][V]<C[u][V])
            {
                viz[V]=1;
                ante[V]=u;
                qu[0]++;
                qu[qu[0]]=V;
                if(V==N)
                return 1;
            }
        }


    }
    return 0;

}

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

  for(flow=0;BFS();flow+=fmin)
  {fmin = 2891821;
      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;
    cit(N);cit(M);
    for(i=1;i<=M;i++)

     {//fin>>x>>y>>z;
         cit(x);
         cit(y);
         cit(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;
}