#include <bits/stdc++.h>

using namespace std;

int f[1010][1010],c[1010][1010],t[1010];
vector<int>v[1010];
int n,m,fl;

int BF(){
    int nr,i,nod,vec,ok=0;
    queue<int>q;
    memset(t,0,sizeof(t));
    t[1]=-1;
    q.push(1);
    while (!q.empty()){
        nod=q.front();
        q.pop();
        nr=v[nod].size();
        for (i=0;i<nr;i++){
            vec=v[nod][i];
            if (t[vec]||c[nod][vec]==f[nod][vec]) continue;
            t[vec]=nod;
            q.push(vec);
            if (vec==n) ok=1;
        }
    }
    return ok;
}

void dinic(){
    int i,j,fc,nr,k;
    while (BF()){
        nr=v[n].size();
        for (k=0;k<nr;k++){
            i=v[n][k];
            if (!t[i]||c[i][n]==f[i][n]) continue;
            fc=c[i][n]-f[i][n];
            for (j=i;j>1;j=t[j]){
                fc=min(fc,c[t[j]][j]-f[t[j]][j]);
            }
            if (!fc) continue;
            f[i][n]+=fc;
            f[n][i]-=fc;
            for (j=i;j>1;j=t[j]){
                f[t[j]][j]+=fc;
                f[j][t[j]]-=fc;
            }
            fl+=fc;
        }
    }
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    int x,y,z,i;
    scanf("%d%d",&n,&m);

    for (i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&z);
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=z;
    }
    dinic();
    printf("%d",fl);
    return 0;
}