#include <fstream>
#include <vector>
#include <bitset>
#include <cstring>
#define nmax 1005
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int> v[nmax];
bitset <nmax> uz;
int c[nmax][nmax],f[nmax][nmax];
int q[nmax],n,m,p,u,t[nmax],sol;

int bfs()
{
    int i,x,y;
    memset(q,0,sizeof(q));
    memset(t,0,sizeof(t));
    uz.reset();
    p=1;u=1;
    q[1]=1;uz[1]=1;
    while (p<=u) {
        x=q[p];
        for (i=0;i<v[x].size();i++) {
            y=v[x][i];
            if (uz[y]==0&&c[x][y]>f[x][y]) {
                q[++u]=y;
                uz[y]=1;
                t[y]=x;
            }
        }
        p++;
    }
    return uz[n];
}

int main()
{
    int i,j,x,y,z,cresc;
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=z;
    }
    while (bfs()) {
        for (i=0;i<v[n].size();i++) {
            x=v[n][i];
            if (uz[x]==0||c[x][n]<=f[x][n])
                continue;
            cresc=c[x][n]-f[x][n];
            while (t[x]) {
                cresc=min(cresc,c[t[x]][x]-f[t[x]][x]);
                x=t[x];
            }
            x=v[n][i];
            f[x][n]+=cresc;
            f[n][x]-=cresc;
            sol+=cresc;
            while (t[x]) {
                f[t[x]][x]+=cresc;
                f[x][t[x]]-=cresc;
                x=t[x];
            }
        }
    }
    fout<<sol<<'\n';
    return 0;
}