#include <bits/stdc++.h>
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");
int lv[1001],viz[1001],f[1001][1001],c[1001][1001],n;
vector<int> v[1001],sol;
queue<int> q;
bool bfs()
{
    int x;
    memset(lv,0,sizeof(lv));
    q.push(1);
    lv[1]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        //if(x==n)
        //    break;
        for(auto it:v[x])
            if(!lv[it]&&f[x][it]<c[x][it])
            {
                lv[it]=lv[x]+1;
                q.push(it);
            }
    }
    //while(!q.empty())
    //    q.pop();
    return lv[n];
}
int flow(int nr,int fl)
{
    if(nr==n)
        return fl;
    for(auto it:v[nr])
        if(lv[it]==lv[nr]+1&&!viz[it]&&f[nr][it]<c[nr][it])
            if(int cf=flow(it,min(fl,c[nr][it]-f[nr][it])))
            {
                f[nr][it]+=cf;
                f[it][nr]-=cf;
                return cf;
            }
    return 0;
}
int main()
{
    int m,nr1,nr2,nr;
    in>>n>>m;
    while(m--)
    {
        in>>nr1>>nr2>>nr;
        v[nr1].push_back(nr2);
        v[nr2].push_back(nr1);
        c[nr1][nr2]=nr;
    }
    nr=0;
    while(bfs())
    {
        memset(viz,0,sizeof(viz));
        while(nr1=flow(1,1<<29))
            nr+=nr1;
    }
    out<<nr;
    return 0;
}