#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}



//Union Find Tree
template<class T> class UnionFindTreeMerge {
public:
	vector<int> parent;
    vector<int> rank;
    vector<T> value;

    UnionFindTreeMerge(int N) : parent(N), rank(N,0), value(N){
		for (int i = 0; i < N; ++i) parent[i] = i;
	}

	void setValue(int n, T v) {
		value[n] = v;
	}

	T rootValue(int n) {
		return value[root(n)];
	}

	int root(int n) {
		return (parent[n] == n ? n : parent[n] = root(parent[n]));
	}

    int same(int n, int m) {
		return root(n) == root(m);
	}
 
	void unite(int n, int m) {
		n = root(n);
		m = root(m);
		if (n == m) return;
		if(rank[n]<rank[m]) {
            parent[n] = m;
			value[m] += value[n];
        }
        else{
            parent[m] = n;
			value[n] += value[m];
            if(rank[n] == rank[m]) rank[n]++;
        }
	}
};

//verify https://atcoder.jp/contests/abc097/tasks/arc097_b

int main() {
	int N,M; cin >> N >> M;
	vector<ll> x(N),u(M),v(M),w(M);
	for(int i = 0; i < N; ++i) cin >> x[i];
	vector<vector<pair<int,int>>> edge(N);
	for(int i = 0; i < M; ++i) {
		cin >> u[i] >> v[i] >> w[i];
		u[i]--,v[i]--;
		edge[u[i]].push_back({v[i],i});
		edge[v[i]].push_back({u[i],i});
	}
	UnionFindTreeMerge<ll> uf(N);
	for(int i = 0; i < N; ++i) uf.setValue(i,x[i]);
	vector<int> idx(M),flg(M,0),vstp(N,0),vste(M,0);
	iota(ALL(idx),0);
	sort(ALL(idx),[&](int l, int r){return w[l] < w[r];});
	for(int i:idx){
		int l = u[i], r = v[i];
		uf.unite(l,r);
		if(w[i]<=uf.rootValue(l)) flg[i] = 1;
	}
	reverse(ALL(idx));
	for(int i:idx){
		if(vste[i] || !flg[i]) continue;
		vste[i] = 1;
		vstp[u[i]] = 1;
		vstp[v[i]] = 1;
		ll s = w[i];
		queue<int> q;
		q.push(u[i]);
		q.push(v[i]);
		while (q.size()){
			int from = q.front();
			q.pop();
			for(auto& e:edge[from]){
				int to = e.first;
				int j = e.second;
				if(w[j]>s) continue;
				if(vste[j]) continue;
				vste[j] = 1;
				if(vstp[to]) continue;
				vstp[to] = 1;
				q.push(to);
			}
		}
	}
	cout << M - accumulate(ALL(vste),0) << endl;
	

    return 0;
}

Measured memory_bytes: 12544