#include <fstream>
#include <vector>
#include <queue>
#define uv v[i][j]
using namespace std;

ifstream f("maxflow.in");
ofstream g("maxflow.out");

int n,m;
int a[1001][1001];
vector<int> v[1001];

bool bfs(int parent[],int son[]){

    bool ok[1001]={};
    son[0]=0;
    queue<int> q;
    ok[1]=1;
    q.push(1);

    while(!q.empty()){
        int i=q.front();
        q.pop();
        for(unsigned j=0;j<v[i].size();j++){
            if(!ok[uv]&&a[i][uv]>0&&uv!=n){
                ok[uv]=1;
                parent[uv]=i;
                q.push(uv);
            }
            if(uv==n){
                ok[n]=1;
                son[++son[0]]=i;
            }
        }
    }

    return ok[n];
}

int main()
{
    f>>n>>m;

    for(int i=1;i<=m;i++){
        int x,y,cs;
        f>>x>>y>>cs;
        v[x].push_back(y);
        v[y].push_back(x);
        a[x][y]=cs;
    }

    int parent[1001]={};
    int son[1001]={};
    int s=0;

    while(bfs(parent,son)){

        for(int t=1;t<=son[0];t++){
            int i=son[t],j,flo=a[son[t]][n];
            while(i!=1){
                j=i;
                i=parent[i];
                flo=min(flo,a[i][j]);
            }
            i=n;
            while(i!=1){
                j=i;
                i=parent[i];
                a[i][j]-=flo;
                a[j][i]+=flo;
            }
            a[son[t]][n]-=flo;
            a[n][son[t]]+=flo;
            s+=flo;
        }
    }

    g<<s;

    return 0;
}