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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

class UnionFind {
public:
    UnionFind(li n, const vector<li>& vals) {
        parent.resize(n);
        value.resize(n);
        edge_num.resize(n);
        rin{
            parent[i] = i;
            value[i] = vals[i];
            edge_num[i] = 0;
        }
    }
    inline void AddEdge(li x, li y) {
        edge_num[find(x)]++;
        if (!Same(x, y)) {
            Merge(x, y);
        }
    }
    inline bool Same(li x, li y) {
        return (find(x) == find(y));
    }
    inline void Merge(li x, li y) {
        li parent_x = find(x);
        li parent_y = find(y);
        parent[parent_x] = parent_y;
        value[parent_y] += value[parent_x];
        edge_num[parent_y] += edge_num[parent_x];
    }
    inline li find(li x) {
        if (parent[x] == x)return x;
        else return (parent[x] = find(parent[x]));
    }
    vector<li> parent;
    vector<li> value;
    vector<li> edge_num;
};

li n, m;
vector<li> vals;

pair<li, PI> edges[100100];;

int main() {
    cin >> n >> m;
    rin{
        li x;
        cin >> x;
        vals.pb(x);
    }
    UnionFind uf(n, vals);

    li alive_edges = 0;

    //
    rep(i, m) {
        cin >> edges[i].S.F >> edges[i].S.S >> edges[i].F;
        edges[i].S.F--;
        edges[i].S.S--;
    }
    sort(edges, edges + m);
    rep(i, m) {
        li x = edges[i].S.F;
        li y = edges[i].S.S;
        li cost = edges[i].F;
        uf.AddEdge(x, y);
        li par = uf.find(x);
        if (cost <= uf.value[par]) {
            alive_edges += uf.edge_num[par];
            uf.edge_num[par] = 0;
        }
    }

    cout << m - alive_edges << endl;


    return 0;
}

Measured memory_bytes: 5876