#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

class UF {
private:
    int sz; vector<int> par,nrank;
public:
    vector<ll> weight;
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz,0); weight.resize(sz, 0); rep(i,sz) par[i] = i; }
    int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } }
    void unite(int x,int y){
        x = find(x),y = find(y); if(x == y) return;
    	if(nrank[x] < nrank[y]) swap(x,y); weight[x] += weight[y]; par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; }
    bool same(int x,int y){ return find(x) == find(y); }
};

struct edge
{
    int from, to;
    ll cost;
    bool operator< (const edge& another) const {
        return cost < another.cost;
    };
};

vector<int> G[2*MAX_N];
bool used[2*MAX_N];
int ver[2*MAX_N];
int ans = 0;

void dfs(int u)
{
    ans++;
    each(v, G[u]){
        if(!used[v]){
            dfs(v);
        }
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    UF uf(n);
    rep(i,n){
        cin >> uf.weight[i];
    }
    vector<edge> vec(m);
    rep(i,m){
        int a,b,y;
        cin >> a >> b >> y;
        vec[i] = (edge){a-1,b-1,y};
    }
    sort(all(vec));
    rep(i,n){
        ver[i] = i;
        used[i] = true;
    }
    int id = n;
    each(e,vec){
        int p = uf.find(e.from), q = uf.find(e.to);
        int u = ver[p], v = ver[q];
        if(p != q){
            if(e.cost <= uf.weight[p]+uf.weight[q]){
                used[id] = true;
            }
            uf.unite(e.from, e.to);
            G[id].pb(u), G[id].pb(v);
        }else{
            G[id].pb(u);
            if(e.cost <= uf.weight[p]){
                used[id] = true;
            }
        }
        ver[uf.find(e.from)] = id++;
    }
    if(!used[id-1]){
        dfs(id-1);
    }
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 14848