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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
struct UnionFind {
  vector<ll> data;
  ll num;
  UnionFind(ll size) : data(size, -1) ,num(size){ }
  bool unite(ll x, ll y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
	  num--;
    }
    return x != y;
  }
  bool find(ll x, ll y) {
    return root(x) == root(y);
  }
  ll root(ll x) {
    return data[x] < 0 ? x : data[x] = root(data[x]);
  }
  ll size(ll x) {
    return -data[root(x)];
  }
};
struct edge {
  ll to,cost,id;
  edge(ll x,ll y,ll z):to(x),cost(y),id(z){};
};

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,m;cin>>n>>m;
  vector<ll>x(n);
  rep(i,0,n)cin>>x[i];
  UnionFind uf(n);
  vector<ll>a(m),b(m),w(m);
  vector<vector<edge>>g(n);
  rep(i,0,m){
    cin>>a[i]>>b[i]>>w[i];a[i]--;b[i]--;
    g[a[i]].EB(b[i],w[i],i);
    g[b[i]].EB(a[i],w[i],i);
  }
  vector<ll>order(m);
  iota(ALL(order),0LL);
  sort(ALL(order),[&](ll x,ll y){
    return w[x]<w[y];
  });
  vector<bool>t(m);
  vector<ll>val=x;
  vector<ll>val2=x;
  for(auto idx:order){
    ll k=val[uf.root(a[idx])]+val[uf.root(b[idx])];
    if(uf.find(a[idx],b[idx]))k=val[uf.root(a[idx])];
    t[idx]=(k>=w[idx]);
    uf.unite(a[idx],b[idx]);
    val[uf.root(a[idx])]=k;
    if(t[idx]){
      val2[a[idx]]=k;
      val2[b[idx]]=k;
    }
  }
  vector<bool>ret(m);
  priority_queue<P>que;
  rep(i,0,n)que.emplace(val2[i],i);
  //debug(val2,n);
  while(!que.empty()){
    ll p=que.top().fi;
    ll v=que.top().se;
    que.pop();
    if(p<val2[v])continue;
    for(auto e:g[v]){
      if(p<e.cost)continue;
      ret[e.id]=true;
      if(val2[e.to]<p){
        val2[e.to]=p;
        que.emplace(p,e.to);
      }
    }
  }
  res=m;
  for(auto b:ret)if(b)res--;
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 17780