#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100010;
const long long MAXM = 400010;
const long long INF = 0x3f3f3f3f;
struct Edge {
  long long to, next, cap, flow;
} edge[MAXM];
long long tol;
long long head[MAXN];
long long gap[MAXN], dep[MAXN], pre[MAXN], cur[MAXN];
void init() {
  tol = 0;
  memset(head, -1, sizeof(head));
}
void addedge(long long u, long long v, long long w, long long rw = 0) {
  edge[tol].to = v;
  edge[tol].cap = w;
  edge[tol].next = head[u];
  edge[tol].flow = 0;
  head[u] = tol++;
  edge[tol].to = u;
  edge[tol].cap = rw;
  edge[tol].next = head[v];
  edge[tol].flow = 0;
  head[v] = tol++;
}
long long sap(long long start, long long end, long long N) {
  memset(gap, 0, sizeof(gap));
  memset(dep, 0, sizeof(dep));
  memcpy(cur, head, sizeof(head));
  long long u = start;
  pre[u] = -1;
  gap[0] = N;
  long long ans = 0;
  while (dep[start] < N) {
    if (u == end) {
      long long Min = INF;
      for (long long i = pre[u]; i != -1; i = pre[edge[i ^ 1].to])
        if (Min > edge[i].cap - edge[i].flow) Min = edge[i].cap - edge[i].flow;
      for (long long i = pre[u]; i != -1; i = pre[edge[i ^ 1].to]) {
        edge[i].flow += Min;
        edge[i ^ 1].flow -= Min;
      }
      u = start;
      ans += Min;
      continue;
    }
    bool flag = false;
    long long v;
    for (long long i = cur[u]; i != -1; i = edge[i].next) {
      v = edge[i].to;
      if (edge[i].cap - edge[i].flow && dep[v] + 1 == dep[u]) {
        flag = true;
        cur[u] = pre[v] = i;
        break;
      }
    }
    if (flag) {
      u = v;
      continue;
    }
    long long Min = N;
    for (long long i = head[u]; i != -1; i = edge[i].next)
      if (edge[i].cap - edge[i].flow && dep[edge[i].to] < Min) {
        Min = dep[edge[i].to];
        cur[u] = i;
      }
    gap[dep[u]]--;
    if (!gap[dep[u]]) return ans;
    dep[u] = Min + 1;
    gap[dep[u]]++;
    if (u != start) u = edge[pre[u] ^ 1].to;
  }
  return ans;
}
int main() {
  long long n, m;
  long long x;
  init();
  long long sum = 0;
  long long S = 0, T = 1;
  cin >> n >> m;
  long long num = 2;
  for (long long i = 0; i < n; i++) {
    cin >> x;
    addedge(num++, T, x);
  }
  long long y, z;
  for (long long i = 0; i < m; i++) {
    cin >> x >> y >> z;
    x++;
    y++;
    sum += z;
    addedge(S, num, z);
    addedge(num, x, INF);
    addedge(num++, y, INF);
  }
  cout << sum - sap(S, T, num) << endl;
  return 0;
}
