#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

const int N = 100010;
vl x(N);


class UnionFind {
public:
  int n;
  vi par; //親
  vi ran; //木の深さ
  vi num; //要素数
  vl ma;
  vl sum;
  vl ok_num;
  vl ng_num;
  
  UnionFind(int _n) {
    n = _n;
    par.resize(n); ran.resize(n); num.resize(n);
    ma.resize(n); sum.resize(n); ok_num.resize(n); ng_num.resize(n);
    for (int i = 0; i < n; i++) {
      par[i] = i; ran[i] = 0; num[i] = 1;
      sum[i] = x[i];
      ma[i] = 0;
      ok_num[i] = ng_num[i] = 0;
    }
  }

  //木の根を求める
  int find(int x) {
    if (par[x] == x) {
      return x;
    }
    else {
      return par[x] = find(par[x]);
    }
  }

  //xとyの属する集合を併合
  void unite(int x, int y, ll c) {
    x = find(x); y = find(y);
    int numsum = num[x] + num[y];
    ll s_sum = sum[x] + sum[y];
    ll ng_sum = ng_num[x] + ng_num[y];
    ll ok_sum = ok_num[x] + ok_num[y];
    if (x == y) {
      if (c <= sum[x]) ok_num[x]++;
      else ng_num[x]++;
      if (c > ma[x]) ma[x] = c;
      return;
    }
    if (ran[x]<ran[y]) {
      par[x] = y;
    }
    else {
      par[y] = x;
      if (ran[x] == ran[y]) {
        ran[x]++;
      }
    }
    x = find(x);
    num[x] = numsum;
    sum[x] = s_sum;
    ma[x] = c;
    ng_num[x] = ng_sum;
    ok_num[x] = ok_sum;
    if (ma[x] <= s_sum) {
      ok_num[x] += ng_num[x] + 1;
      ng_num[x] = 0;
    }
    else {
      ng_num[x]++;
    }
  }

  //xとyが同じ集合に属するか否か
  bool same(int x, int y) {
    return find(x) == find(y);
  }

};


int main() {
  int n, m;
  cin >> n >> m;
  rep (i, n) {
    cin >> x[i];
  }
  vector<pair<ll, pii> > G(m);
  rep (i, m) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    ll c;
    cin >> c;
    G[i] = {c, pii(u, v)};
  }
  sort(all(G));
  UnionFind uf(n);
  rep (i, m) {
    ll c = G[i].first;
    int u = G[i].second.first, v = G[i].second.second;
    uf.unite(u, v, c);
  }
  cout << uf.ng_num[uf.find(0)] << endl;
}


Measured memory_bytes: 6912