#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////
struct unionfind {
	ll N;
	vector<ll> par;
	vector<ll> sz;//根の場合、その木のサイズ
	vector<ll> ed;

	unionfind(ll N0) {
		N = N0;
		par.assign(N + 1, -1);
		sz.assign(N + 1, 1);
		ed.assign(N + 1, 0);
		repn(i, N) ed[i] = i;
	}

	ll root(ll x) {
		if (par[x] == -1) { return x; }
		par[x] = root(par[x]);
		return par[x];
	}

	bool same(ll x, ll y) {
		return root(x) == root(y);
	}

	void unite(ll x, ll y, ll i) {
		ll a = root(x);
		ll b = root(y);
		if (a != b) {
			par[a] = b; sz[b] += sz[a];
			ed[b] = i;
		}

	}

	ll size(ll x) {
		ll r = root(x);
		return sz[r];
	}

	ll edge(ll x) {
		ll r = root(x);
		return ed[r];
	}
};


int main() {
	ll N, M;
	cin >> N >> M;

	vector<ll> X(N + 1);
	repn(i, N) cin >> X[i];

	vector<pair<ll, pair<ll, ll>>> p(M + 1);
	repn(i, M) {
		cin >> p[i].second.first >> p[i].second.second >> p[i].first;
	}
	sort(++p.begin(), p.end());

	vector<ll> A(M + 1), B(M + 1), Y(M + 1);
	repn(i, M) {
		A[i] = p[i].second.first;
		B[i] = p[i].second.second;
		Y[i] = p[i].first;
	}

	vector<ll> par(N + M + 1,0);
	vector<ll> sz(N + M + 1, 0);
	vector<ll> lca(M + 1);

	repn(i, N) { sz[i] = X[i]; }

	unionfind uf(N);
	repn(i, M) {
		ll x = uf.edge(A[i]);
		ll y = uf.edge(B[i]);

		//cout << x << y << i << endl;

		if (x == y) { lca[i] = x; continue; }
		else {
			lca[i] = N + i;
			par[x] = N + i;
			par[y] = N + i;
			sz[N + i] = sz[x] + sz[y];
			uf.unite(A[i], B[i], N+i);
		}
	}

	//repn(i, N + M)cout << i << " " << par[i] << " " << sz[i] << endl;
	//repn(i, M) cout << i << " " << lca[i] << endl;

	vector<ll> erase(M + 1, 0);

	for (ll i = M; i >= 1; i--) {
		ll x = lca[i];
		if (Y[i] > sz[x]) {
			if (par[x] == 0 || erase[par[x] - N] == 1) { erase[i] = 1; }
		}
	}

	ll ans = 0;
	repn(i, M) ans += erase[i];

	cout << ans << endl;


	
	
	system("PAUSE");

}

Measured memory_bytes: 13048