#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;
typedef pair<int,P> Q;
typedef vector<Q> vq;

// Union find
struct uf {
  vi d;
  uf(){}
  uf(int mx):d(mx,-1){}
  int root(int x) {
    if(d[x] < 0) return x;
    return d[x] = root(d[x]);
  }
  bool unite(int x, int y) {
    x = root(x); y = root(y);
    if(x == y) return false;
    if(d[x] > d[y]) swap(x,y);
    d[x] += d[y]; d[y] = x;
    return true;
  }
  int size(int x) { return -d[root(x)];}
};
//




int main() {
  int n,m;
  scanf("%d%d",&n,&m);
  vi x(n);
  cin>>x;
  vq es(m);
  rep(i,m) {
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    --a; --b;
    es[i] = Q(c,P(a,b));
  }
  sort(rng(es));
  uf t(n);
  vq ts;
  rep(i,m) {
    int a = es[i].se.fi;
    int b = es[i].se.se;
    if (t.unite(a,b)) {
      ts.pb(es[i]);
    }
  }
  reverse(rng(ts));
  vvi to(n);
  rep(i,sz(ts)) {
    int a = ts[i].se.fi;
    int b = ts[i].se.se;
    to[a].pb(b);
    to[b].pb(a);
  }
  vl w(1,suma(x));
  vi g(n);
  vi used(n);
  rep(i,sz(ts)) {
    int a = ts[i].se.fi;
    int b = ts[i].se.se;
    if (ts[i].fi <= w[g[a]]) continue;
    vi as(1,a), bs(1,b);
    queue<P> qa, qb;
    qa.push(P(a,0));
    qb.push(P(b,0));
    used[a] = 1; used[b] = 1;
    while (sz(qa) && sz(qb)) {
      {
        P p = qa.front(); qa.pop();
        int u = to[p.fi][p.se];
        p.se++;
        if (p.se < sz(to[p.fi])) qa.push(p);
        if (g[u] == g[p.fi] && !used[u]) {
          as.pb(u);
          used[u] = 1;
          qa.push(P(u,0));
        }
      }
      {
        P p = qb.front(); qb.pop();
        int u = to[p.fi][p.se];
        p.se++;
        if (p.se < sz(to[p.fi])) qb.push(p);
        if (g[u] == g[p.fi] && !used[u]) {
          bs.pb(u);
          used[u] = 1;
          qb.push(P(u,0));
        }
      }
    }
    if (sz(qa)) {
      swap(a,b);
      swap(as,bs);
    }
    for (int v : as) used[v] = 0;
    for (int v : bs) used[v] = 0;
    int pi = g[a];
    int ni = sz(w);
    w.pb(0);
    for (int v : as) {
      g[v] = ni;
      w[ni] += x[v];
      w[pi] -= x[v];
    }
  }
  int ans = 0;
  rep(i,m) {
    int a = es[i].se.fi;
    int b = es[i].se.se;
    if (g[a] != g[b]) {
      ++ans;
      continue;
    }
    int ni = g[a];
    if (es[i].fi > w[ni]) ++ans;
  }
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 11508