#include <stdio.h>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;
FILE*fi=fopen("maxflow.in","r");
FILE*g=fopen("maxflow.out","w");
int x,y,z,m,i,n,f[1001][1001],c[1001][1001],t[1001],fl;
vector <int> v[1001];
int bf(){
int i,nod,vec;
queue <int> q;
memset(t,0,sizeof(t));
t[1]=-1;
q.push(1);
while(!q.empty()){
nod=q.front();
q.pop();
for(i=0;i<v[nod].size();i++){
    vec=v[nod][i];
    if(t[vec]||c[nod][vec]==f[nod][vec])continue;
    t[vec]=nod;
    q.push(vec);
    if(vec==n) return 1;

}

}
return 0;

}
void dinic(){
int i,j,fc;
while(bf())
    for(i=1;i<=n;i++){

        if(!t[i]||c[i][n]==f[i][n])continue;
        fc=c[i][n]-f[i][n];
        for(j=n;j>1;j=t[j])
            fc=min(fc,c[t[j]][j]-f[t[j]][j]);
        if(!fc)continue;
        f[i][n]+=fc;
        f[n][i]-=fc;
        for(j=i;j>1;j=t[j])
        {f[t[j]][j]+=fc;
        f[j][t[j]]-=fc;



        }
        fl+=fc;
    }



}



int main()
{fscanf(fi,"%d%d",&n,&m);
for(i=1;i<=m;i++){
    fscanf(fi,"%d%d%d",&x,&y,&z);
    v[x].push_back(y);
    v[y].push_back(x);
    c[x][y]=z;


}
dinic();
fprintf(g,"%d",fl);
    return 0;
}