#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 5010, INF = 0x3f3f3f3f;

int N, M, T = 1, X, Y, C, Source, Sink, Nr, Total, A[NMAX], Cap[NMAX][NMAX], Flow[NMAX][NMAX], Father[NMAX];
vector<int> FG[NMAX];
vector<pair<int, int> > G[NMAX];
bool Used[NMAX];

void AddNewNodes(int T)
{
    for (int i = 1; i <= N; ++ i)
    {
        int A = (T - 1) * N + i;
        Cap[A][A + N] = INF;
        FG[A].push_back(A + N);
        FG[A + N].push_back(A);
        for (int j = 0; j < G[i].size(); ++ j)
        {
            int Node = G[i][j].first, Max = G[i][j].second, B = T * N + Node;
            FG[A].push_back(B);
            FG[B].push_back(A);
            Cap[A][B] = Max;
        }
    }
}

bool BFS()
{
    memset(Used, 0, sizeof(Used));
    memset(Father, 0, sizeof(Father));
    queue<int> Q;
    Q.push(Source);
    Used[Source] = 1;

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

        if (Node == Sink) continue;

        for (vector<int> :: iterator it = FG[Node].begin(); it != FG[Node].end(); ++ it)
            if (!Used[*it] && Cap[Node][*it] > Flow[Node][*it])
            {
                Used[*it] = 1;
                Father[*it] = Node;
                Q.push(*it);
            }
    }
    return Used[Sink];
}

void AddFlow()
{
    while (BFS())
    {
        for (vector<int> :: iterator it = FG[Sink].begin(); it != FG[Sink].end(); ++ it)
            if (Used[*it] && Cap[*it][Sink] != Flow[*it][Sink])
            {
                Father[Sink] = *it;
                int MinFlow = INF;
                for (int Node = Sink; Node != Source; Node = Father[Node])
                    MinFlow = min(MinFlow, Cap[Father[Node]][Node] - Flow[Father[Node]][Node]);
                for (int Node = Sink; Node != Source; Node = Father[Node])
                {
                    Flow[Father[Node]][Node] += MinFlow;
                    Flow[Node][Father[Node]] -= MinFlow;
                }
                Total += MinFlow;
            }
    }
}

int main()
{
    freopen("algola.in", "r", stdin);
    freopen("algola.out", "w", stdout);

    scanf("%i %i", &N, &M);
    for (int i = 1; i <= N; ++ i)
    {
        scanf("%i", &A[i]);
        Nr += A[i];
        FG[Source].push_back(i);
        FG[i].push_back(Source);
        Cap[Source][i] = A[i];
    }

    for (int i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i", &X, &Y, &C);
        G[X].push_back(make_pair(Y, C));
        G[Y].push_back(make_pair(X, C));
    }

    while(Total < Nr)
    {
        AddNewNodes(T);
        Sink = T * N + 1;

        AddFlow();

        T ++;
    }

    printf("%i\n", T - 1);
}