#include <fstream>
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("maxflow.in");
ofstream cout ("maxflow.out");
int niv[1008],frec[1008],mat[1008][1008],ras;
vector<int>G[1008];
int surs,dest;
void bfs(int nod)
{
    for(int i=surs;i<=dest;i++)
    {
        niv[i]=-1;
        frec[i]=0;
    }
    niv[nod]=0;
    queue<int>Q;
    Q.push(nod);
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(auto i:G[nod])
        {
            if(niv[i]==-1 && mat[nod][i]>0)
            {
                niv[i]=niv[nod]+1;
                Q.push(i);
            }
        }
    }
}
int dfs(int nod,int maxx)
{
    if(maxx==0 || nod==dest)
    {
        return maxx;
    }
    while(frec[nod]<G[nod].size())
    {
        int k=G[nod][frec[nod]];
        if(mat[nod][k]>0 && niv[k]==niv[nod]+1)
        {
            int x=dfs(k,min(maxx,mat[nod][k]));
            if(x>0)
            {
                mat[nod][k]-=x;
                mat[k][nod]+=x;
                return x;
            }
            frec[nod]++;
        }
        else
        frec[nod]++;
    }
    return 0;
}
int flux(int nod)
{
    bfs(nod);
    if(niv[dest]==-1)
        return 0;
    int val=0;
    while(true)
    {
        int x=dfs(surs,1e9);
        if(x==0)
            break;
        val+=x;
    }
    ras+=val;
    return val;
}
int main()
{
    int n,m;
    int a,b,c;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        G[a].push_back(b);
        G[b].push_back(a);
        mat[a][b]+=c;
    }
    surs=1;
    dest=n;
    while(flux(surs));
    cout<<ras;
    return 0;
}