using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#define pb push_back
struct nod{
    int lg,c;
};
#define nmax 1010
vector<nod> G[nmax];
int N,M;
int q[nmax],viz[nmax],ante[nmax];
int C[nmax][nmax],F[nmax][nmax];

ofstream fout("maxflow.out");

bool BFS()
{   int i;
    for(i=0;i<=N;i++)
    {
        q[i]=0;
        viz[i]=0;
    }
    q[++q[0]]=1;
    viz[1]=1;
    int front=1,u;
    vector<nod>::iterator it;

    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();it++)
        {
            if(!viz[it->lg])
            {
                if(C[u][it->lg]>F[u][it->lg])
                {
                    viz[it->lg]=1;
                    ante[it->lg]=u;
                    q[++q[0]]=it->lg;
                }
            }
        }
    }
    return viz[N];
}

void solve()
{
    int fmin,flow=0,i;
    vector<nod>::iterator it;
    for(;BFS();)
    {
        for(it=G[N].begin();it<G[N].end();it++)
        {
            if(viz[it->lg])
            {
                fmin=C[it->lg][N]-F[it->lg][N];
                for(i=it->lg;i!=1;i=ante[i])
                {
                    fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);

                }
                F[it->lg][N]+=fmin;
                F[N][it->lg]-=fmin;

                for(i=it->lg;i!=1;i=ante[i])
                {
                    F[ante[i]][i]+=fmin;
                    F[i][ante[i]]-=fmin;
                }
                flow+=fmin;

            }
        }
    }

    fout<<flow<<"\n";
}

void cit()
{
    ifstream fin("maxflow.in");
    int i,x,y,z;
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>z;
        G[x].pb((nod){y,z});
        G[y].pb((nod){x,z});
        C[x][y]+=z;

    }

    fin.close();
}

int main()
{
    cit();

    solve();

    fout.close();
    return 0;
}