#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

#define pb push_back
#define DIM 1005

int c[DIM][DIM],f[DIM][DIM];
vector <int> g[DIM];
queue <int> q;
int n,m,flow;
int t[DIM];

void read ()
{
    int i,x,y,z;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d",&x,&y,&z);
        g[x].pb (y);
        g[y].pb (x);
        c[x][y]=z;
    }
}

int bf ()
{
    vector <int> :: iterator it;
    int nod;

    memset (t,-1,sizeof (t));
    t[1]=0;
    for (q.push (1); !q.empty (); q.pop ())
    {
        nod=q.front ();
        for (it=g[nod].begin (); it!=g[nod].end (); ++it)
            if (t[*it]==-1 && c[nod][*it]!=f[nod][*it])
            {
                t[*it]=nod;
                q.push (*it);
            }
    }
    return t[n]!=-1;
}

void solve ()
{
    vector <int> :: iterator it;
    int i,min_cur;

    for ( ; bf (); )
        for (it=g[n].begin (); it!=g[n].end (); ++it)
            if (t[*it] && c[*it][n]!=f[*it][n])
            {
                min_cur=c[*it][n]-f[*it][n];
                for (i=*it; i!=1; i=t[i])
                    min_cur=min (min_cur,c[t[i]][i]-f[t[i]][i]);
                flow+=min_cur;
                f[*it][n]+=min_cur;
                f[n][*it]-=min_cur;
                for (i=*it; i!=1; i=t[i])
                {
                    f[t[i]][i]+=min_cur;
                    f[i][t[i]]-=min_cur;
                }
            }
    printf ("%d",flow);
}

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

    read ();
    solve ();

    return 0;
}