#include<stdio.h>
#include<string.h>
#define N 1024
#define INF 100000000

long q[N], c[N][N], tata[N], n, nr, sol[N];

int bfs(){
long x,p,u,i,j;
     memset(tata,0,N * sizeof(long));
     q[0]=1;tata[1]=1;nr=0;
     for (p=0,u=0;p<=u && !tata[n] ;p++){
         x=q[p];
         for (j=1;j<=n && !tata[n] ;j++)
             if (c[x][j]>0 && !tata[j]){
                tata[j]=x;q[++u]=j;
                if (tata[n]!=0){ u--,tata[n]==0; sol[++nr]=x;} 
             }     
     }
     return (tata[n]);
}

int main (){
long x,y,z,flux=0,i,m,min,w;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    
    scanf("%d %d ",&n,&m);
    for (i=1;i<=m;i++){ scanf("%d %d %d",&x,&y,&z);
        c[x][y]=z;}
    
    
    while (bfs()){
          min=INF;
          for (w=1;w<=nr;w++){
              min=c[sol[w]][n];
              
              for (i=sol[w];i!=1;i=tata[i])
                  if (c[tata[i]][i]<min) min=c[tata[i]][i];
              
              c[sol[w]][n]-=min;c[n][sol[w]]+=min;
              for (i=sol[w];i!=1;i=tata[i]) c[tata[i]][i]-=min,c[i][tata[i]]+=min;
          
              flux+=min;
          
          }    
    }
    
    printf("%d\n",flux);
    
    
    return 0;
}