# include <fstream>
# include <vector>
# include <cstring>
# include <deque>
# define DIM 1010
# define INF 1000000000
# define pb push_back
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
deque <int> d;
vector <int> Lista[DIM];
int c[DIM][DIM],f[DIM][DIM],t[DIM];
int Marcat[DIM],n,m,i,x,y,cost,mn,sol,parent;
int bfs(){
    int ok=0;
    memset(Marcat,0,sizeof(Marcat));
    d.pb(1);
    Marcat[1]=1;
    while(!d.empty()){
        int nc=d.front();
        if(nc==n)
            ok=1;

        d.pop_front();
        for(int i=0;i<Lista[nc].size();i++){
            int nv=Lista[nc][i];
            if(!Marcat[nv]&&f[nc][nv]<c[nc][nv]){
                Marcat[nv]=1;
                t[nv]=nc;
                d.pb(nv);
            }
        }
    }
    return ok;
}
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].pb(y);
        Lista[y].pb(x);
        c[x][y]=cost;
    }
    while(bfs()){
        for (int j=0; j<Lista[n].size(); j++) {
            parent = Lista[n][j];
            if (Marcat[parent] && c[parent][n] > f[parent][n]) {
                mn=c[parent][n] - f[parent][n];
                for(i=parent;t[i]!=0;i=t[i])
                    mn=min(mn,c[t[i]][i]-f[t[i]][i]);
                f[parent][n] += mn;
                f[n][parent] -= mn;
                for(i=parent;t[i]!=0;i=t[i]){
                    f[t[i]][i]+=mn;
                    f[i][t[i]]-=mn;
                }
                sol+=mn;

            }

        }
    }
    fout<<sol<<"\n";
    return 0;
}