#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

class UF {
 public:
  vector<LL> parent;
  vector<LL> val;
  int N;

 public:
  UF(int n) {
    N = n;
    parent.resize(N);
    val.resize(N);
    for (int i = 0; i < N; i++) {
      parent[i] = i;
    }
  }
  int find(int v) {
    if (v == parent[v]) return v;
    return parent[v] = find(parent[v]);
  }

  bool Union(int v, int u) {
    v = find(v);
    u = find(u);
    if (v == u) return false;

    parent[u] = v;
    return true;
  }
};

void solve(long long N, long long M, std::vector<long long> X,
           std::vector<long long> A, std::vector<long long> B,
           std::vector<long long> Y) {
  for (int i = 0; i < M; i++) {
    A[i]--;
    B[i]--;
  }
  UF ufPre(N);

  vector<int> parent(2 * N - 1, 0);
  vector<int> values(2 * N - 1, 0);
  vector<pair<LL, PII>> data;
  for (int i = 0; i < M; i++) {
    data.push_back(make_pair(Y[i], PII(A[i], B[i])));
  }
  vector<vector<int>> child(2 * N - 1);
  vector<int> usedVal(M, -1);
  vector<LL> tree(2 * N - 1, 0);
  for (int i = 0; i < N; i++) tree[i] = X[i];

  sort(data.begin(), data.end());
  int ind = N;
  for (int i = 0; i < N; i++) ufPre.val[i] = i;
  for (int i = 0; i < data.size(); i++) {
    auto elem = data[i];
    int v = elem.second.first;
    int u = elem.second.second;
    int tv = ufPre.val[ufPre.find(v)];
    int tu = ufPre.val[ufPre.find(u)];

    if (ufPre.Union(v, u)) {
      child[ind].push_back(tv);
      child[ind].push_back(tu);
      tree[ind] = tree[tv] + tree[tu];
      parent[tv] = ind;
      parent[tu] = ind;
      ufPre.val[ufPre.find(v)] = ind;
      usedVal[i] = ind;
      ind++;
    }
  }
  vector<int> treeUsed(2 * N - 1, 1);
  for (int i = M - 1; i >= 0; i--)
    if (usedVal[i] >= 0) {
      int ind = usedVal[i];
      if (ind != 2 * N - 2 && treeUsed[parent[ind]] != 0) continue;
      if (tree[ind] < data[i].first) {
        usedVal[i] = -2;
        treeUsed[ind] = 0;
      }
    }

  UF uf(N);
  int ans = 0;
  for (int i = 0; i < N; i++) uf.val[i] = X[i];
  vector<int> finalUsed(M, 0);
  for (int i = 0; i < M; i++) {
    auto elem = data[i];
    int v = elem.second.first;
    int u = elem.second.second;
    int pv = uf.find(v);
    int pu = uf.find(u);
    // cout << v << " " << u << " " << usedVal[i] << endl;
    if (usedVal[i] < 0) continue;
    if (uf.Union(v, u)) {
      finalUsed[i] = true;
      uf.val[pv] += uf.val[pu];
      // cout << "  " << pv << " " << pu << " " << uf.val[pv] << " " <<
      // uf.val[pu]
      ans++;
    }
  }
  for (int i = 0; i < M; i++) {
    auto elem = data[i];
    int v = elem.second.first;
    int u = elem.second.second;
    if (usedVal[i] != -1) continue;
    LL cost = elem.first;
    // cout << v << " " << u << " " << cost << endl;
    if (cost <= uf.val[uf.find(v)]) ans++;
  }
  /*
  dump(parent);
  dump(uf.val);
  dump(tree);
  */
  cout << M - ans << endl;
}
int main() {
  long long N;
  scanf("%lld", &N);
  long long M;
  scanf("%lld", &M);
  std::vector<long long> X(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &X[i]);
  }
  std::vector<long long> A(M);
  std::vector<long long> B(M);
  std::vector<long long> Y(M);
  for (int i = 0; i < M; i++) {
    scanf("%lld", &A[i]);
    scanf("%lld", &B[i]);
    scanf("%lld", &Y[i]);
  }
  solve(N, M, std::move(X), std::move(A), std::move(B), std::move(Y));
  return 0;
}


Measured memory_bytes: 21872