#include <bits/stdc++.h>

using namespace std;
#define nmax 1001
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int> v[nmax];
int t[nmax],c[nmax][nmax],f[nmax][nmax],fc,fl,n,m,i,x,y,cs,j;
int bf()
{
    int nod;
    queue <int> q;
    memset(t,0,sizeof(t));
    t[1]=-1;
    q.push(1);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(auto it:v[nod])
        {
            if(t[it] || c[nod][it]==f[nod][it])
                continue;
            t[it]=nod;
            q.push(it);
            if(it==n)
                return 1;
        }
    }
    return 0;
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>cs;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=cs;
    }
    while(bf())
    {
        fc=0;
        for(i=0; i<v[n].size(); i++)
        {
            int i2=v[n][i];
            if(!t[i2]||c[i2][n]==f[i2][n])
                continue;
            fc=c[i2][n]-f[i2][n];
            for(j=i2; j>1; j=t[j])
                fc=min(fc,c[t[j]][j]-f[t[j]][j]);
            if(!fc)
                continue;
            f[i2][n]+=fc;
            f[n][i2]-=fc;
            for(j=i2; j>1; j=t[j])
            {
                f[t[j]][j]+=fc;
                f[j][t[j]]-=fc;
            }
            fl+=fc;
        }
    }
    fout<<fl;
    return 0;
}