/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define N 1010
using namespace std;
ifstream f("flux.in");
ofstream g("flux.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
vector<int> v[N];
queue<int> q;
int F[N][N],flux,C[N][N],T[N],x,y,n,m,viz[N];
int bfs(int x)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        if(x==n)
            continue;
        FIT(it,v[x])
        {
            if(viz[*it]||C[x][*it]==F[x][*it])
                continue;
            T[*it]=x;
            viz[*it]=1;
            q.push(*it);
        }
    }
    return viz[n];
}
int main ()
{
    f>>n>>m;
    FOR(i,1,m)
    {
        f>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
        f>>C[x][y];
    }
    while(bfs(1))
    FIT(it,v[n])
    {
        if(!viz[*it]||C[*it][n]==F[*it][n])
            continue;
        T[n]=*it;
        int x=n;
        int fm=(1<<30);
        while(x!=1)
        {
            fm=min(fm,C[T[x]][x]-F[T[x]][x]);
            x=T[x];
        }
        x=n;
        if(!fm)
            continue;
        while(x!=1)
        {
            F[T[x]][x]+=fm;
            F[x][T[x]]-=fm;
        }
        flux+=fm;
    }
    g<<flux;
    return 0;
}