#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <vector>
#define MAX 1001
using namespace std;

vector<int>u[MAX];
int c[MAX][MAX],f[MAX][MAX],n,m,k,cd[MAX],t[MAX];
bool viz[MAX];

bool bfs(){
    int x,y,i,j,k;
    memset(viz,0,sizeof(viz));
    cd[1]=viz[1]=k=i=1;
    for(i=1;i<=k;i++){
        x=cd[i];
        for(j=0;j<u[x].size();j++){
            y=u[x][j];
            if(!viz[y]&&c[x][y]!=f[x][y]){
                viz[y]=1;
                cd[++k]=y;
                t[y]=x; } }
        }
    return viz[n];
}

int main(){
    int x,y,z,fmin,flux;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=m;i++){
            scanf("%d %d %d",&x,&y,&z);
            c[x][y]=z;
            u[x].push_back(y);
            u[y].push_back(x);}
        flux=0;
        for(;bfs();){
            for(int i=0;i<u[n].size();i++){
                for(x=u[n][i];x!=1;x=t[x])fmin=min(fmin,c[t[x]][x]-f[t[x]][x]);
            if(fmin!=0){
                flux+=fmin;
                for(x=u[n][i];x!=1;x=t[x]){
                    f[t[x]][x]+=fmin;
                    f[x][t[x]]-=fmin; }
                f[t[u[n][i]]][n]+=fmin;
                f[n][t[u[n][i]]]-=fmin; } }
        }
    printf("%d\n",flux);
}