#include <bits/stdc++.h>

using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n,m;
int ans;
int x,y,z;
vector <int> v[1005];
int cap[1005][1005];
int niv[1005],mb[1005];
queue <int> q;
void dinic_bfs(int nod)
{
    niv[nod]=1;
    q.push(nod);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int i=0;i<v[x].size();i++)
            if(cap[x][v[x][i]]>0&&niv[v[x][i]]==0)
        {
            q.push(v[x][i]);
            niv[v[x][i]]=1+niv[x];
        }
    }
}
int dinic_dfs(int nod,int fl)
{
    if(nod==n||fl==0)
        return fl;
    while(mb[nod]<v[nod].size())
    {
        int x=v[nod][mb[nod]];
        mb[nod]++;
        if(niv[x]==niv[nod]+1)
        {
            int nr=dinic_dfs(x,min(cap[nod][x],fl));
            if(nr!=0)
            {
                cap[nod][x]-=nr;
                cap[x][nod]+=nr;
                return nr;
            }
        }
    }
}
bool flux()
{
    int val=0;
    for(int i=1;i<=n;i++)
        niv[i]=0,mb[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++)
    {
        fin>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        cap[x][y]=z;
    }
    while(flux());
    fout<<ans;
    return 0;
}