#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cmath>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

const int NMAX=1e3+5;
const int INF=2e9;

vector<int>v[NMAX];

int flux[NMAX][NMAX];
int t[NMAX];
bool viz[NMAX];

int n;
int d;
int s;

bool bfs()
{
    int i;
    for(i=1;i<=n;i++)
        viz[i]=false;
    queue<int>q;
    q.push(s);
    viz[s]=true;
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        if(p==d)
            return true;
        for(auto i:v[p])
        {
            if(!viz[i] && flux[p][i]>0)
            {
                viz[i]=true;
                q.push(i);
                t[i]=p;
            }
        }
    }
    return false;
}

int main()
{
    int m,i,j,mini=INF,x,y,c;
    long long maxi=0;
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        v[x].push_back(y);
        v[y].push_back(x);
        flux[x][y]=c;
    }
    s=1;
    d=n;
    while(bfs())
    {
        for(auto i:v[d])
        {
            if(!viz[i] || flux[i][d]<=0)
                continue;
            mini=INF;
            t[d]=i;
            x=d;
            while(x!=s)
            {
                mini=min(mini,flux[t[x]][x]);
                x=t[x];
            }
            if(mini==0)
                continue;
            x=d;
            while(x!=s)
            {
                flux[x][t[x]]+=mini;
                flux[t[x]][x]-=mini;
                x=t[x];
            }
            maxi+=mini;
        }
    }
    cout<<maxi;
    return 0;
}