#include <bits/stdc++.h>
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");
int viz[1001],pr[1001],f[1001][1001],c[1001][1001],n;
vector<int> v[1001];
queue<int> q;
bool bfs()
{
    int x;
    memset(viz,0,sizeof(viz));
    memset(pr,0,sizeof(pr));
    q.push(1);
    viz[1]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(auto it:v[x])
            if(!viz[it]&&f[x][it]<c[x][it])
            {
                viz[it]=1;
                pr[it]=x;
                q.push(it);
            }
    }
    return viz[n];
}
int val(int nr)
{
    if(!pr[nr])
        return 1<<29;
    return min(c[pr[nr]][nr]-f[pr[nr]][nr],val(pr[nr]));
}
void rec(int nr,int s)
{
    if(!pr[nr])
        return;
    f[pr[nr]][nr]+=s;
    f[nr][pr[nr]]-=s;
    rec(pr[nr],s);
}
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())
        for(auto it:v[n])
            if(viz[it]&&f[it][n]!=c[it][n])
            {
                pr[n]=it;
                nr1=val(n);
                nr+=nr1;
                rec(n,nr1);
            }
    out<<nr;
    return 0;
}