#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
using namespace std;
int i,x,y,z,fc,fl,c[1005][1005],f[1005][1005],t[1005],n,m;

vector <int> v[1005];
int bf(){
int nod,vec,i;
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]){
            t[vec]=nod;
            q.push(vec);

        }

    }


    }
if(t[n]) return 1;
return 0;

}
void dinic(){
int i,j,vec;
while(bf())
for(i=0;i<v[n].size();i++){
    vec=v[n][i];
    if(t[vec]&&c[vec][n]>f[vec][n]){
        fc=c[vec][n]-f[vec][n];
        for(j=vec;j!=1;j=t[j])
            fc=min(fc,c[t[j]][j]-f[t[j]][j]);
        if(fc){
            f[vec][n]+=fc;
            f[n][vec]-=fc;
            for(j=vec;j!=1;j=t[j]){
                f[t[j]][j]+=fc;
                f[j][t[j]]-=fc;
            }
            fl+=fc;
        }

    }

}





}

int main()
{
   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);
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=z;
       // c[y][x]=0;

    }
    dinic();
    printf("%d\n",fl);

   return 0;
}