#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#define M 2000000000
#define maxxx 1001
using namespace std;
FILE *f=fopen("maxflow.in","r");
FILE *g=fopen("maxflow.out","w");
queue<int>q;
vector<int>L[maxxx];
int tata[maxxx],C[maxxx][maxxx],F[maxxx][maxxx],n,m,Sursa,Dest,flux;
int bfs()
{
    memset(tata,0,sizeof(tata));
    tata[Sursa]=-1;
    q.push(Sursa);
    int ok=0,nodcur,vecin,j;
    while(!q.empty())
    {
        nodcur=q.front();
        q.pop();
        for(j=0;j<L[nodcur].size();j++)
        {
            vecin=L[nodcur][j];
            if(tata[vecin]==0&&C[nodcur][vecin]>F[nodcur][vecin])
            {
                if(vecin!=Dest)
                {
                    tata[vecin]=nodcur;
                    q.push(vecin);
                }
                else ok=1;
            }
        }
    }
    return ok;
}
void solve()
{
    int ok,vecin,mini,j,nod;
    ok=bfs();
    while(ok)
    {
        for(j=0;j<L[Dest].size();j++)
        {
            vecin=L[Dest][j];
            if(tata[vecin]&&C[vecin][Dest]>F[vecin][Dest])
            {
                tata[Dest]=vecin;
                mini=M;
                for(nod=Dest;nod!=Sursa;nod=tata[nod])
                    if(mini>C[tata[nod]][nod]-F[tata[nod]][nod])
                        mini=C[tata[nod]][nod]-F[tata[nod]][nod];//din parcurgea BFS

                flux+=mini;
                for(nod=Dest;nod!=Sursa;nod=tata[nod])
                {
                    F[tata[nod]][nod]+=mini;
                    F[nod][tata[nod]]-=mini;//pentru graful rezidual
                }

            }
        }
        ok=bfs();
    }
}
int main()
{
    int i,x,y,z;
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d%d%d",&x,&y,&z);
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=z;
    }
    Sursa=1;
    Dest=n;
    solve();
    fprintf(g,"%d",flux);
    return 0;
}