#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define meow(cat...) fprintf(stderr, cat)

const ll MaxN = 5e5 + 10;
const ll MaxM = 5e5 + 10;
const ll inf = 0x3f3f3f3f3f3f3f3f;

struct edge
{
    ll next, to, flow, cost;
} e[MaxM << 1];

ll head[MaxN], dis[MaxN], cur[MaxN], vis[MaxN];
ll n, m, s, t, cnt = 1, mincost, maxflow, a[MaxN];

void add(ll u, ll v, ll f, ll c)
{
    ++cnt;
    e[cnt].to = v;
    e[cnt].flow = f;
    e[cnt].cost = c;
    e[cnt].next = head[u];
    head[u] = cnt;
}

void add_edge(ll u, ll v, ll f, ll c) { add(u, v, f, c), add(v, u, 0, -c); }

inline ll read()
{
    ll x = 0;
    char ch = getchar();
    while(ch > '9' || ch < '0')
        ch = getchar();
    while(ch <= '9' && ch >= '0') 
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    return x;
}

ll bfs(ll s)
{
    std::queue<ll> q;
    memset(dis, 0x3f, sizeof(dis));
    memcpy(cur, head, sizeof(head));
    dis[s] = 0, q.push(s), vis[s] = 1;
    while(!q.empty())
    {
        ll u = q.front(); q.pop(), vis[u] = 0;
        for(ll i = head[u]; i; i = e[i].next)
        {
            ll v = e[i].to, c = e[i].flow;
            if(dis[v] > dis[u] + e[i].cost && c)
            {
                dis[v] = dis[u] + e[i].cost;
                if(!vis[v]) vis[v] = 1, q.push(v);
            }
        }
    }
    return dis[t] != inf;
}

ll dinic(ll u, ll flow)
{
    if(u == t)
    {
        maxflow += flow;
        return flow;
    }
    ll rest = flow; vis[u] = 1;
    for(ll i = cur[u]; i && rest; i = e[i].next)
    {
        ll v = e[i].to, c = e[i].flow, k;
        if(!vis[v] && (dis[v] == dis[u] + e[i].cost) && c)
        {
            cur[u] = i, k = dinic(v, std::min(c, rest));
            rest -= k, e[i].flow -= k, e[i ^ 1].flow += k;
            mincost += k * e[i].cost;
        }
    } 
    vis[u] = 0;
    return flow - rest;
}

void solve()
{
    while(bfs(s))
    {
        memset(vis, 0, sizeof(vis));
        dinic(s, inf);
    }
}

signed main()
{   
    n = read(), m = read(), s = 2 * n + 1, t = 2 * n + 2;
    for(int i = 1; i <= n; i++)
        a[i] = read(), add_edge(s, i, 1, 0), add_edge(i + n, t, 1, 0);
    for(int i = 1; i <= m; i++)
    {
        int u = read(), v = read(), d = read();
        if(u > v) std::swap(u, v);
        add_edge(u, v + n, inf, d);
    }
    for(int j = 1; j <= n; j++)
        add_edge(s, j + n, inf, a[j]);
    solve(), printf("%lld\n", mincost);
    return 0;
}