#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#define maxN 1001
using namespace std;
void openIOFiles()
{
 freopen("maxflow.in","r",stdin);
 freopen("maxflow.out","w",stdout);
}

vector <int> g[maxN];
int c[maxN][maxN];
int f[maxN][maxN];
int T[maxN]; 
int flux(0),S,D,i,n,x,y,m,aux;
 
inline int bfs()
{
 int ok=0;
 queue <int> q;
 vector <int>::iterator it;
 memset(T,0,sizeof(T));
 T[S]=-1;
 q.push(S);
 while(!q.empty()) 
     {
      int nod=q.front();
      for(it=g[nod].begin();it!=g[nod].end();++it)
        if(T[*it]==0&&c[nod][*it]>f[nod][*it])
                  {
                   if(*it!=D){
                              T[*it]=nod;
                              q.push(*it);
                             }
                         else ok=1;
                   }
    q.pop();
    }
 return ok;
}
 
inline void dinic()
{
 vector <int>::iterator it;
 int drum;
 for(drum=bfs();drum;drum=bfs())
        for(it=g[D].begin();it!=g[D].end();++it)
                 if(T[*it]&&c[*it][D]>f[*it][D]) {
                                                  T[D]=*it;
                                                  int min=0x7fffffff;
                  for(int nod=D;nod!=S;nod=T[nod])
                    if(min>c[T[nod]][nod]-f[T[nod]][nod])
                        min=c[T[nod]][nod]-f[T[nod]][nod];
                  if(min<=0) continue;
                  flux+=min;
                  for(int nod=D;nod!=S;nod=T[nod]){
                                                   f[T[nod]][nod]+=min;
                                                   f[nod][T[nod]]-=min;
                                                   }
                                                 }
}
  
int main()
{
 openIOFiles();
 memset(c,0,sizeof(c));
 memset(f,0,sizeof(f));
 scanf("%d%d",&n,&m);
 while(m--){
            scanf("%d%d%d",&x,&y,&aux);
            c[x][y]=aux;
            g[x].push_back(y);
            g[y].push_back(x);
            }
 S=1; D=n;
 dinic();
 printf("%d",flux);
 return 0;
}