#include<cstring>
#include<fstream>
#include<queue>
#include<vector>
#define NMAX (1<<10)
#define oo (1<<30)
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");
int n,m,x,y,z,flux,minim,no;
int p[NMAX][NMAX],fl[NMAX][NMAX],daddy[NMAX];
bool viz[NMAX];
vector<int>graph[NMAX];
queue<int>chiu;
void scan()
{
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        in>>x>>y>>z;
        graph[x].push_back(y);
        graph[y].push_back(x);
        p[x][y]=z;
    }
}
bool bf()
{
    memset(viz, 0, sizeof(viz));
    while(!chiu.empty())
        chiu.pop();
    chiu.push(1);
    viz[1]=1;
    while(!chiu.empty())
    {
        int node=chiu.front();
        chiu.pop();
        for(size_t i=0;i<graph[node].size();i++)
        {
            int neigh=graph[node][i];
            if(!viz[neigh]&p[node][neigh]>fl[node][neigh])
            {
                chiu.push(neigh);
                daddy[neigh]=node;
                viz[neigh]=1;
                if(neigh==n)
                    return true;
            }
        }
    }
    return false;
}
void EK()
{
    scan();
    flux=0;
    while(bf())
    {
        for(int i=0;i<graph[n].size();i++)
        {
            int vertex=graph[n][i];
            if(viz[vertex]&(p[vertex][n]!=fl[vertex][n]))
            {
                daddy[n]=vertex;
                minim=oo;
            for(no=n;no!=1;no=daddy[no])
                minim= min(minim,p[daddy[no]][no]-fl[daddy[no]][no]);
            if(minim!=0)
                {
                for(no=n;no!=1;no=daddy[no])
                    {
                        fl[daddy[no]][no]+=minim;
                        fl[no][daddy[no]]-=minim;
                    }
                }
                flux+=minim;
            }
        }
    }
    out<<flux;
}
int main()
{
    EK();
}