#include <iostream>
#include <fstream>
#include <queue>
#include <cstring>

using namespace std;

#define Nmax 1005
#define INF 0x3f3f3f3f

int *G[Nmax];
int degree[Nmax];
int tata[Nmax];
bool viz[Nmax];
int C[Nmax][Nmax];
int F[Nmax][Nmax];

queue <int> Q;

int N, M;

void read()
{
    fstream f;

    f.open( "maxflow.in", ios::in );

    f >> N >> M;

    for ( int i = 1, a, b, c; i <= M; ++i )
    {
        f >> a >> b >> c;

        degree[a]++;
    }

    f.close();

    f.open( "maxflow.in", ios::in );

    f >> N >> M;

    for ( int i = 1; i <= N; ++i )
            G[i] = new int[ degree[i] ],
            degree[i] = 0;

    for ( int i = 1, a, b, c; i <= M; ++i )
    {
        f >> a >> b >> c;

        C[a][b] = c;

        G[a][ degree[a]++ ] = b;
    }

    f.close();
}

inline bool BFS( int sourse, int destination )
{
    memset( viz, 0, sizeof( viz ) );

    Q.push( sourse );
    viz[sourse] = true;
    tata[sourse] = 1;

    while( !Q.empty() )
    {
        int nod = Q.front();
        Q.pop();

        for ( int i = 0; i < degree[nod]; ++i )
        {
            int vertex = G[nod][i];

            if ( C[nod][vertex] == F[nod][vertex] || viz[vertex] )
                    continue;

            viz[vertex] = true;
            tata[vertex] = nod;
            Q.push( vertex );

            if ( vertex == destination )
                    return true;
        }
    }

    return false;
}

int Edmonds_Karp( int sourse, int destination )
{
    int flow, fmin, nod;

    for ( flow = 0; BFS( sourse, destination ); flow += fmin )
    {
        fmin = INF;

        for ( nod = N; nod != 1; nod = tata[nod] )
                fmin = min( fmin, C[ tata[nod] ][nod] - F[ tata[nod] ][nod] );

        for ( nod = destination; nod != sourse; nod = tata[nod] )
        {
            F[ tata[nod] ][nod] += fmin;
            F[nod][ tata[nod] ] -= fmin;
        }
    }

    return flow;
}

void print()
{
    ofstream g("maxflow.out");

    g << Edmonds_Karp(1, N);
}

int main()
{
    read();
    print();

    return 0;
}