#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
long long id[200001], siz[200001];
void union1(long long x, long long y) {
  if (siz[x] <= siz[y])
    siz[y] += siz[x], id[x] = y;
  else
    siz[x] += siz[y], id[y] = x;
}
long long root1(long long x) {
  while (id[x] != x) x = id[x];
  return x;
}
void pre(long long n) {
  for (int i = 0; i <= n; i++) siz[i] = 1, id[i] = i;
}
long long X[200001], vis[200001];
vector<long long> A[200001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, second, s2, s3;
  vector<pair<long long, long long>> v, w;
  vector<long long>::iterator itrv;
  set<pair<long long, pair<long long, long long>>> S;
  set<pair<long long, pair<long long, long long>>>::iterator itr;
  cin >> n >> m;
  pre(n);
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  for (i = 1; i <= n; i++) {
    cin >> X[i];
    v.push_back(make_pair(X[i], i));
  }
  for (i = 0; i < m; i++) {
    cin >> x >> y >> z;
    if (z >= (X[x] + X[y])) {
      continue;
    } else {
      S.insert(make_pair(z, make_pair(x, y)));
    }
  }
  c = 0;
  sort(v.begin(), v.end());
  pair<long long, pair<long long, long long>> aa;
  for (i = 1; i < v.size(); i++) {
    if (root1(v[i].second) == root1(v[0].second)) {
      continue;
    }
    p = v[i].first + v[0].first;
    q = LLONG_MAX;
    while (S.size()) {
      aa = *S.begin();
      if (p <= aa.first) {
        break;
      } else {
        a = root1(aa.second.first);
        b = root1(aa.second.second);
        if (a != b) {
          c += aa.first;
          union1(a, b);
        }
        S.erase(S.begin());
      }
    }
    if (root1(v[i].second) == root1(v[0].second)) {
      continue;
    }
    union1(root1(v[i].second), root1(v[0].second));
    c += p;
  }
  cout << c << endl;
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
