# include <fstream>
# include <vector>
# include <queue>
# include <cstring>
# 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,i,j,nod,mn,s;
int flux(){
    memset(Marcat,0,sizeof(Marcat));
    int ok=0;
    q.push(1);
    Marcat[1]=1;
    while(!q.empty()){
        int nc=q.front();
        q.pop();
        if(nc==n)
            ok=1;
        for(int i=0;i<Lista[nc].size();i++){
            int nv=Lista[nc][i];
            if(f[nc][nv]<c[nc][nv]&&!Marcat[nv]){
                Marcat[nv]=1;
                t[nv]=nc;
                q.push(nv);
            }
        }
    }
    return ok;
}
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()){
        for(j=0;j<Lista[n].size();j++){
            if(Marcat[Lista[n][j]]&&c[Lista[n][j]][n]>f[Lista[n][j]][n]){
                nod=Lista[n][j];
                mn=c[nod][n]-f[nod][n];
                for(i=nod;t[i]>0;i=t[i])
                    mn=min(mn,c[t[i]][i]-f[t[i]][i]);
                for(i=nod;t[i]>0;i=t[i]){
                    f[t[i]][i]+=mn;
                    f[i][t[i]]-=mn;
                }
                s+=mn;
            }
        }
    }
    fout<<s<<"\n";
    return 0;
}