#include<cstdio>
#include<queue>
#define maxn 1005
#define inf 99999999
using namespace std;
queue <int> Q;
vector <int> G[maxn];
int n,m,C[maxn][maxn],F[maxn][maxn],tt[maxn],viz[maxn],flow,fmin,x,e1,e2,z;
int BFS(){
    for(int i=1;i<=n;++i)
        viz[i]=0;
    int nod;
    viz[1]=1;
    Q.push(1);
    while(Q.empty()==0){
        nod=Q.front();
        Q.pop();
        if(nod==n)
            continue;
        for(int i=0;i<G[nod].size();++i){
            x=G[nod][i];
            if(C[nod][x]==F[nod][x] || viz[x]==1)
                continue;
            Q.push(x);
            tt[x]=nod;
            viz[x]=1;
        }
    }
    return viz[n];
}
int main(){
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i){
        scanf("%d%d%d",&e1,&e2,&z);

        C[e1][e2]=z;
        G[e1].push_back(e2);
        G[e2].push_back(e1);
    }
    flow=0;
    for(;BFS();){
        for(int i=0;i<G[n].size();++i){
            int x=G[n][i];
            if( viz[x]==0 || F[x][n]==C[x][n])
                continue;
            tt[n]=x;
            fmin=inf;
            for(int j=n;j!=1;j=tt[j]){
                fmin=min(fmin,C[tt[j]][j]-F[tt[j]][j]);
            }
            if(fmin==0)
                continue;
            for(int j=n;j!=1;j=tt[j]){
                F[tt[j]][j]+=fmin;
                F[j][tt[j]]-=fmin;
            }
            flow+=fmin;

        }
    }
    printf("%d",flow);
    return 0;


}