#include <bits/stdc++.h>

using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
typedef long long ll;
vector <int> v[1006];
int mb[1005],niv[1005];
int cap[1005][1005];
int ans;
int n,m;
queue <int> q;
void dinic_bfs(int start)
{
    q.push(start);
    niv[start]=1;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto nod:v[x])
            if(cap[x][nod]>0&&niv[nod]==0)
        {
            q.push(nod);
            niv[nod]=1+niv[x];
        }
    }
}
int dinic_dfs(int nod,int fl)
{
    if(nod==n||fl==0)
        return fl;
    while(mb[nod]<(int)v[nod].size())
    {
        int urm=v[nod][mb[nod]];
        mb[nod]++;
        if(cap[nod][urm]>0&&niv[urm]==niv[nod]+1)
        {
            int val=dinic_dfs(urm,min(cap[nod][urm],fl));
            if(val>0)
            {
                cap[nod][urm]-=val;
                cap[urm][nod]+=val;
                return val;
            }
        }
    }
        return 0;
}
bool flux()
{
    int val=0;
    for(int i=1;i<=n;i++)
        mb[i]=0,niv[i]=0;
    dinic_bfs(1);
    if(niv[n]==0)
        return 0;
    while(true)
    {
        int x=dinic_dfs(1,1e9);
        val+=x;
        if(x==0)
            break;
    }
    ans+=val;
    if(val==0)
        return 0;
    return 1;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        cap[x][y]=z;
    }
    while(flux());
    fout<<ans;
    return 0;
}