#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define sd (v[i][j])
using namespace std;

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

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

bool bfs(int parent[]){

    queue<int> q;
    q.push(1);

    bool ok[1001]={};
    ok[1]=1;

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

    return ok[n];
}

int max_flow(){

    int parent[1001];
    int s=0;

    while(bfs(parent)){

        int flo=1000000;
        int u=n,ve;
        while(u!=1){
            ve=u;
            u=parent[u];
            flo=min(flo,a[u][ve]);
        }

        u=n;
        while(u!=1){
            ve=u;
            u=parent[u];
            a[u][ve]-=flo;
            a[ve][u]+=flo;
        }

        s+=flo;
    }

    return s;
}

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

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

    g<<max_flow();

    return 0;
}