#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define pii pair<int, int>

using namespace std;

const int N = 6e4 + ;

const int M = 2e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

int n, m, S, T, sum, tot, p[N], a, b, c, level[N], head[N];

struct Edge {

    int to, w, nx;

}edge[M << ];

void add(int u, int v, int w) {

    edge[tot].to = v;

    edge[tot].w = w;

    edge[tot].nx = head[u];

    head[u] = tot++;

}

bool bfs() {

    memset(level, , sizeof(level));

    queue<int> que;

    que.push(S), level[S] = ;

    while(!que.empty()) {

        int u = que.front(); que.pop();

        if(u == T) return true;

        for(int i = head[u]; ~i; i = edge[i].nx) {

            int v = edge[i].to, w = edge[i].w;

            if(level[v] || w <= ) continue;

            level[v] = level[u] + ;

            que.push(v);

        }

    }

    return false;

}

int dfs(int u, int p) {

    if(u == T) return p;

    int ret = ;

    for(int i = head[u]; ~i; i = edge[i].nx) {

        int v = edge[i].to, w = edge[i].w;

        if(level[v] != level[u] +  || w <= ) continue;

        int f = dfs(v, min(p - ret, w));

        ret += f;

        edge[i].w -= f;

        edge[i ^ ].w += f;

        if(ret == p) break;

    }

    if(!ret) level[u] = ;

    return ret;

}

int Dinic() {

    int ans = ;

    while(bfs()) ans += dfs(S, inf);

    return ans;

}

void init() {

    tot = ; sum = ;

    memset(head, -, sizeof(head));

}

int main() {

    init();

    scanf("%d%d", &n, &m);

    S = , T = n + m + ;

    for(int i = ; i <= n; i++) {

        scanf("%d", &p[i]);

        add(i + m, T, p[i]);

        add(T, i + m, );

    }

    for(int i = ; i <= m; i++) {

        scanf("%d%d%d", &a, &b, &c);

        add(S, i, c), add(i, S, );

        add(i, a + m, inf), add(a + m, i, );

        add(i, b + m, inf), add(b + m, i, );

        sum += c;

    }

    int ans = Dinic();

    printf("%d\n", sum - ans);

    return ;

}

/*

*/