#include <bits/stdc++.h>

using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n,m,c[1001][1001],ans,level[1001],S,D,maxim[1001],from[1001],pt[1001];
vector<int> muchii[1001];
const int INF=1e9;
int dfs(int nod,int cap)
{
    if(cap==0||nod==n)
        return cap;
    while(pt[nod]<muchii[nod].size())
    {
        int i=muchii[nod][pt[nod]];
        pt[nod]++;
        if(c[nod][i]>0&&level[i]==level[nod]+1)
        {
            int x=dfs(i,min(c[nod][i],cap));
            if(x>0)
            {
                c[nod][i]-=x;
                c[i][nod]+=x;
                return x;
            }
        }
    }
    return 0;
}
int flux()
{
    for(int i=1;i<=n;i++)
    {
        level[i]=-1;
        from[i]=-1;
        pt[i]=0;
    }
    level[S]=0;
    queue<int> coada;
    coada.push(S);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(int i=0;i<muchii[nod].size();i++)
        {
            int node=muchii[nod][i];
            if(level[node]==-1&&c[nod][node]>0)
            {
                level[node]=level[nod]+1;
                coada.push(node);
            }
        }
    }
    if(level[D]==-1)
        return 0;
    int val=0;
    while(true)
    {
        int x=dfs(S,INF);
        if(x==0)
            break;
        ans+=x;
        val+=x;
    }
    if(val==0)
        return 0;
    return 1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fout.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        fin>>c[a][b];
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    S=1;
    D=n;
    while(flux());
    fout<<ans;
    return 0;
}