#include <fstream>
#include <vector>
#include <queue>
#define nmax 1002
#define inf 1e9
using namespace std;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
int n,m,x,y,c[nmax][nmax],f[nmax][nmax],flux,dist[nmax];
vector<int>v[nmax];
queue<int>q;
bool bfs(int s,int d){
    for(int i=1;i<=n;i++)
        dist[i]=inf;
    q.push(s);
    dist[s]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto i:v[nod])
            if(dist[i]>dist[nod]+1&&c[nod][i]>f[nod][i]){
                dist[i]=dist[nod]+1;
                q.push(i);
            }
    }
    return dist[d]!=inf;
}
int dinic(int nod,int d,int val){
    if(val<=0)
        return 0;
    if(nod==d)
        return val;
    int r=0;
    for(auto i:v[nod])
        if(dist[nod]==dist[i]-1){
            int add=dinic(i,d,min(c[nod][i]-f[nod][i],val-r));
            f[nod][i]+=add;
            f[i][nod]-=add;
            r+=add;
        }
    return r;
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c[x][y];
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(bfs(1,n))/// cat timp mai pot trimite flux
        flux+=dinic(1,n,inf);
    cout<<flux;
    return 0;
}