// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

typedef struct UnionFind_ {
  vector<int> par, rank_, siz;
  UnionFind_(){}
  explicit UnionFind_(int n): rank_(n, 0), siz(n, 1) {
    par.resize(n);
    for(int i = 0; i < n; i++)par[i] = i;
  }
  int find(int x) {
    if(par[x] == x)return x;
    else return par[x] = find(par[x]);
  }
  bool same(int x, int y) {
    if(find(x) == find(y))return true;
    else return false;
  }
  bool unite(int x, int y){
    int xp = find(x);
    int yp = find(y);
    if(xp == yp)return false;
    if(rank_[xp] > rank_[yp]){
      par[yp] = xp;
      siz[xp] += siz[yp];
    }
    else if(rank_[xp] < rank_[yp]){
      par[xp] = yp;
      siz[yp] += siz[xp];
    }
    else {
      par[yp] = xp;
      siz[xp] += siz[yp];
      rank_[xp]++;
    }
    return true;
  }
  int size(int i){
    return siz[find(i)];
  }
} UnionFind;

ll x[100010], a[100010], b[100010], y[100010];
ll sum[100010], esum[100010];
vector<pair<int, ll>> edge[100010];
bool used[100010];
map<P, int> eidx;
ll cost = 0;

void dfs(int i){
  for(auto e: edge[i]){
    int idx = eidx[mk(i, e.first)];
    if(used[idx] || cost < e.second)continue;
    used[idx] = true;
    dfs(e.first);
  }
}

int main(int argc, char const* argv[])
{
  int n, m; cin >> n >> m;
  rep(i, n)cin >> x[i];
  rep(i, m){
    cin >> a[i] >> b[i], a[i]--, b[i]--;
    cin >> y[i];
    edge[a[i]].pb(b[i], y[i]);
    edge[b[i]].pb(a[i], y[i]);
    eidx[mk(a[i], b[i])] = i;
    eidx[mk(b[i], a[i])] = i;
  }
  vector<int> e(m); rep(i, m)e[i] = i;
  sort(whole(e), [&](int i, int j){
    if(y[i] != y[j])return y[i] < y[j];
    return i < j;
  });
  rep(i, n)sum[i] += x[i];
  UnionFind uf(n);
  rep(i, m){
    if(uf.same(a[e[i]], b[e[i]])){
      esum[e[i]] = sum[uf.find(a[e[i]])];
    }else{
      int ap = uf.find(a[e[i]]), bp = uf.find(b[e[i]]);
      uf.unite(a[e[i]], b[e[i]]);
      if(uf.find(a[e[i]]) == ap){
        sum[ap] += sum[bp];
      }else{
        sum[bp] += sum[ap];
      }
      esum[e[i]] = sum[uf.find(a[e[i]])];
    }
  }
  int res = 0;
  rrep(i, m){
    if(used[e[i]])continue;
    if(esum[e[i]] < y[e[i]]){
      ++res;
      continue;
    }
    cost = y[e[i]];
    dfs(a[e[i]]);
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 37504