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