# include <fstream>
# include <vector>
# include <cstring>
# include <queue>
# define DIM 1010
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector<int> Lista[DIM];
queue<int> q;
int c[DIM][DIM],f[DIM][DIM],Marcat[DIM],t[DIM];
int n,m,x,y,cost,nc,nv,dif,sol,i;
bool flux(){
    memset(Marcat,0,sizeof(Marcat));
    q.push(1);
    Marcat[1]=1;
    while(!q.empty()){
        nc=q.front();
        q.pop();
        for(int i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i];
            if(!Marcat[nv]&&f[nc][nv]<c[nc][nv]){
                Marcat[nv]=1;
                t[nv]=nc;
                q.push(nv);
            }
        }
    }
    return Marcat[n];
}
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(y);
        Lista[y].push_back(x);
        c[x][y]=cost;
    }
    while(flux()){
        nc=n;
        for(i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i];
            if(Marcat[nv]&&f[nv][nc]<c[nv][nc]){
                dif=c[nv][nc]-f[nv][nc];
                for(x=nv;t[x]!=0;x=t[x])
                    dif=min(dif,c[t[x]][x]-f[t[x]][x]);
                for(x=nv;t[x]!=0;x=t[x]){
                    f[t[x]][x]+=dif;
                    f[x][t[x]]-=dif;
                }
                f[nv][nc]+=dif;
                sol+=dif;
            }
        }
    }
    fout<<sol<<"\n";
    return 0;
}