#include<fstream>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int> v[1005];
queue <int> q;
int n,m,x,y,c,minim,flux,F[1005][1005],C[1005][1005],T[1005];
int bfs()
{
    int i;
    memset(T,0,sizeof(T));
    T[1]=-1;
    q.push(1);
    while (!q.empty())
    {
        x=q.front(); q.pop();
        for (i=0;i<v[x].size();++i)
        {
            y=v[x][i];
            if (!T[y] && F[x][y]<C[x][y])
            {
                T[y]=x;
                q.push(y);
            }
        }
    }
    return T[n];
}
int main()
{
    int i;
    fin>>n>>m;
    for (i=1;i<=m;++i)
    {
        fin>>x>>y>>c;
        v[x].push_back(y);
        v[y].push_back(x);
        C[x][y]=c;
        C[y][x]=0;
    }
    while (bfs())
    {
        for (i=0;i<v[n].size();++i)
        {
            x=v[n][i];
            if (F[x][n]<C[x][n] && T[x])
            {
                minim=C[x][n]-F[x][n];
                while (T[x]!=-1)
                {
                    minim=min(minim,C[T[x]][x]-F[T[x]][x]);
                    x=T[x];
                }
                flux+=minim;
                x=v[n][i];
                F[x][n]+=minim, F[n][x]-=minim;
                while (T[x]!=-1)
                {
                    F[T[x]][x]+=minim, F[x][T[x]]-=minim;
                    x=T[x];
                }
            }
        }
    }
    fout<<flux<<"\n";
    return 0;
}