#include <stdio.h>
#include <cstring>
#include <vector>
#include <bitset>
#define nmax 1005
#define inf 0x3f3f3f3f
using namespace std;
int n,m,i,j,sol,fmin,x,y,z,cost[nmax][nmax],f[nmax][nmax],coada[nmax],ul=0,tata[nmax],fr[nmax];
vector <int> g[nmax];
bool bfs()
{
    memset(fr,0,sizeof(fr));
    coada[1]=1; ul=1; fr[1]=1;
    for (int i=1;i<=ul;i++) {
        x=coada[i];
        if (x==n) continue;
        for (unsigned int j=0;j<g[x].size();j++) {
            y=g[x][j];
            if (cost[x][y]==f[x][y] || fr[y]) continue;
            fr[y]=1; ul++; coada[ul]=y;
            tata[y]=x;
        }
    }
    return (fr[n]==1);
}
int main() {
freopen("maxflow.in","r",stdin);
freopen("maxflow.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=1;i<=m;i++) {
    scanf("%d %d %d",&x,&y,&z);
    cost[x][y]=cost[x][y]+z; g[x].push_back(y); g[y].push_back(x);
}
while (bfs()) {
    for (unsigned int i=0;i<g[n].size();i++) {
        x=g[n][i];
        if (cost[x][n]==f[x][n] || !fr[x]) continue;
        tata[n]=x; fmin=inf;
        for (j=n;j>1;j=tata[j])
            fmin=min(fmin,cost[tata[j]][j]-f[tata[j]][j]);
        if (fmin==0) continue;
        for (j=n;j>1;j=tata[j]) {
            f[tata[j]][j]+=fmin;
            f[j][tata[j]]-=fmin;
        }
        sol=sol+fmin;
    }
}
printf("%d",sol);
return 0;
}