#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <typename...>
static inline int getchar_unlocked(void) {
  return getchar();
}
template <typename...>
static inline void putchar_unlocked(int c) {
  putchar(c);
}
void reader(int& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
void reader(ll& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
int reader(char c[]) {
  int i, s = 0;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c[s++] = i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c[s++] = i;
  }
  c[s] = '\0';
  return s;
}
int reader(string& c) {
  int i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c.push_back(i);
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c.push_back(i);
  };
  return ((int)c.size());
}
template <class T, class S>
void reader(T& x, S& y) {
  reader(x);
  reader(y);
}
template <class T, class S, class U>
void reader(T& x, S& y, U& z) {
  reader(x);
  reader(y);
  reader(z);
}
template <class T, class S, class U, class V>
void reader(T& x, S& y, U& z, V& w) {
  reader(x);
  reader(y);
  reader(z);
  reader(w);
}
void writer(int x, char c) {
  int s = 0, m = 0;
  char f[10];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(ll x, char c) {
  int s = 0, m = 0;
  char f[20];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(const char c[]) {
  int i;
  for (i = 0; c[i] != '\0'; i++) putchar_unlocked(c[i]);
}
void writer(const string& x, char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
void writer(const char x[], char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
template <class T>
void writerLn(T x) {
  writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
  writer(x, ' ');
  writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, '\n');
}
template <class T, class S, class U, class V>
void writerLn(T x, S y, U z, V v) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, ' ');
  writer(v, '\n');
}
template <class T>
void writerArr(T x[], int n) {
  if (!n) {
    putchar_unlocked('\n');
    return;
  }
  for (int i = 0; i < (n - 1); i++) writer(x[i], ' ');
  writer(x[n - 1], '\n');
}
template <class T>
void writerArr(vector<T>& x) {
  writerArr(x.data(), (int)x.size());
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
ll mod_pow(ll a, ll n, ll mod) {
  ll ret = 1;
  ll p = a % mod;
  while (n) {
    if (n & 1) ret = ret * p % mod;
    p = p * p % mod;
    n >>= 1;
  }
  return ret;
}
template <class T>
T extgcd(T a, T b, T& x, T& y) {
  for (T u = y = 1, v = x = 0; a;) {
    T q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return b;
}
ll mod_inv(ll a, ll m) {
  ll x, y;
  extgcd<ll>(a, m, x, y);
  return (m + x % m) % m;
}
class UnionFind {
 private:
  int n;
  vector<int> a;

 public:
  UnionFind(int n) : n(n), a(n, -1) {}
  int find(int x) { return a[x] < 0 ? x : (a[x] = find(a[x])); }
  bool same(int x, int y) { return find(x) == find(y); }
  bool same(Pii& p) { return same(p.first, p.second); }
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (a[x] > a[y]) swap(x, y);
    a[x] += a[y];
    a[y] = x;
    n--;
    return true;
  }
  bool unite(Pii& p) { return unite(p.first, p.second); }
  int size() const { return n; }
  int size(int x) { return -a[find(x)]; }
};
int main() {
  int n, m;
  reader(n, m);
  vector<ll> x(n);
  for (int i = 0; i < (n); i++) reader(x[i]);
  vector<tuple<ll, int, int>> vp;
  for (int i = 0; i < (m); i++) {
    int a, b;
    ll y;
    reader(a, b, y);
    a--;
    b--;
    vp.emplace_back(y, a, b);
  }
  sort(vp.begin(), vp.end());
  vector<tuple<int, int, ll>> others;
  vector<tuple<int, int, ll>> tree;
  {
    UnionFind uf(n);
    for (auto& yab : vp) {
      int a, b;
      ll y;
      tie(y, a, b) = yab;
      if (uf.unite(a, b)) {
        tree.emplace_back(a, b, y);
      } else {
        others.emplace_back(a, b, y);
      }
    }
  }
  vector<pair<Pll, int>> nodes;
  vector<vector<int>> edges(2 * n - 1);
  {
    for (int i = 0; i < (n); i++) nodes.emplace_back(Pll(0, x[i]), -1);
    vector<int> nid;
    for (int i = 0; i < (n); i++) nid.push_back(i);
    UnionFind uf(n);
    for (int treeId = 0; treeId < (((int)tree.size())); treeId++) {
      int a, b;
      ll y;
      tie(a, b, y) = tree[treeId];
      a = uf.find(a);
      b = uf.find(b);
      uf.unite(a, b);
      const int nextId = ((int)nodes.size());
      edges[nextId] = {nid[a], nid[b]};
      ll nextHev = max(nodes[nid[a]].first.first, nodes[nid[b]].first.first);
      nextHev = max(nextHev, y);
      ll nextH = nodes[nid[a]].first.second + nodes[nid[b]].first.second;
      nodes.emplace_back(Pll(nextHev, nextH), treeId);
      nid[a] = nid[b] = nextId;
    }
  }
  int ans = 0;
  UnionFind finalUf(n);
  for (int i = 2 * n - 2; i >= n; i--) {
    if (nodes[i].first.first > nodes[i].first.second) {
      ans++;
      continue;
    }
    for (auto to : edges[i]) {
      nodes[to].first.second = nodes[i].first.second;
    }
    int a, b;
    ll y;
    tie(a, b, y) = tree[nodes[i].second];
    finalUf.unite(a, b);
  }
  map<int, ll> finalH;
  for (int i = 0; i < (n); i++) finalH[finalUf.find(i)] += x[i];
  for (auto& aby : others) {
    int a, b;
    ll y;
    tie(a, b, y) = aby;
    if (!finalUf.same(a, b)) continue;
    a = finalUf.find(a);
    if (finalH[a] < y) {
      ans++;
    }
  }
  writerLn(ans);
  return 0;
}
