#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) { }
    bool unionSet(int x, int 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;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

vi X;
using Edge = tuple<int, int, int>;
vector<Edge> edges;
vector<vi> G;
vll xsum;
vi tbl;

void dfs(int v, int k, int pk){
	if(tbl[v] != pk) return;
	tbl[v] = k;
	xsum[k] += X[v];

	for(auto & nv : G[v]){
		dfs(nv, k, pk);
	}
}

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, m; cin >> n >> m;
    xsum = vll(n);
    X = vi(n); for(auto& e : X) cin >> e, xsum[0] += e;
    rep(i, m){
    	int a, b, y; cin >> a >> b >> y;
    	a--, b--;
    	edges.emplace_back(Edge(y, a, b));
    }
    sort(_all(edges));

    G = vector<vi>(n);
    UnionFind uf(n);
    vi used(m);
    rep(i, m){
    	auto& e = edges[i];
    	int a, b, y; tie(y, a, b) = e;
    	if(uf.findSet(a, b)) continue;

    	uf.unionSet(a, b);
    	G[a].emplace_back(b);
    	G[b].emplace_back(a);
    	used[i] = true;
    }

    int idx = 0;
    tbl = vi(n);
    rrep(i, m){
    	if(not used[i]) continue;

    	int a, b, y; tie(y, a, b) = edges[i];
    	assert(tbl[a] == tbl[b]);

    	int ck = tbl[a];
    	if(xsum[ck] >= y) continue;

    	using Pair = tuple<int, int>;
    	queue<Pair> qa, qb;
    	qa.push(Pair(a, b));
    	qb.push(Pair(b, a));
    	while(true){
    		if(qa.empty() || qb.empty()){
    			if(qb.empty()) swap(a, b);
    			tbl[b] = -1;
    			dfs(a, ++idx, ck);
    			tbl[b] = ck;
    			xsum[ck] -= xsum[idx];
    			break;
    		}

    		int v, pv; tie(v, pv) = qa.front(); qa.pop();
    		for(auto& nv : G[v]){
    			if(tbl[nv] != tbl[v] or nv == pv) continue;
    			qa.push(Pair(nv, v));
    		}
    		tie(v, pv) = qb.front(); qb.pop();
    		for(auto& nv : G[v]){
    			if(tbl[nv] != tbl[v] or nv == pv) continue;
    			qb.push(Pair(nv, v));
    		}
    	}
    }

    // rep(i, n){
    // 	cerr << tbl[i] << endl;
    // }
    int res = 0;
    rep(i, m){
    	int a, b, y; tie(y, a, b) = edges[i];
    	if(tbl[a] != tbl[b] or xsum[tbl[a]] < y){
    		res++;
    	}
    }
    cout << res << endl;

    return 0;
}


Measured memory_bytes: 9332