#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#define nmax 1001
using namespace std;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
int n,m,x,y,f[nmax][nmax],flow,c[nmax][nmax],t[nmax];
vector<int>v[nmax],vd;
queue<int>q;
bool viz[nmax];
bool bfs(int s,int d){
    for(int i=1;i<=n;i++)
        viz[i]=0,t[i]=0;
    viz[s]=1;
    q.push(s);
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto i:v[nod])
            if(!viz[i]&&f[nod][i]<c[nod][i]){
                t[i]=nod;
                viz[i]=1;
                q.push(i);
            }
    }
    return viz[d];
}
void add(int d){
    for(auto i:vd)
        if(f[i][d]<c[i][d]){
            int mini=c[i][d]-f[i][d];
            for(int nod=i;t[nod]!=0;nod=t[nod])
                mini=min(c[t[nod]][nod]-f[t[nod]][nod],mini);
            f[i][d]+=mini;
            f[d][i]-=mini;
            for(int nod=i;t[nod]!=0;nod=t[nod]){
                f[t[nod]][nod]+=mini;
                f[nod][t[nod]]-=mini;
            }
            flow+=mini;
        }
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c[x][y];
        v[x].push_back(y);
        if(y==n)
            vd.push_back(x);
    }
    while(bfs(1,n))
        add(n);
    cout<<flow;
    return 0;
}