#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
ll W[MAXN];
int par[MAXN];
bool mark[MAXN], good[MAXN];
pair<int, pii> E[MAXN];
vector<pii> G[MAXN];

int getpar(int x){ return (par[x]==x?x:par[x]=getpar(par[x]));}

void dfs(int node, int val){
	for (pii p:G[node]) if (p.second<=val && !mark[p.second]){
		mark[p.second]=1;
		dfs(p.first, val);
		ans++;
//		cerr<<"add edge "<<p.second<<"\n";
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=n; i++) cin>>W[i], par[i]=i;
	for (int i=0; i<m; i++) cin>>E[i].second.first>>E[i].second.second>>E[i].first;
	sort(E, E+m);
	for (int i=0; i<m; i++){
		int u=E[i].second.first, v=E[i].second.second;
		G[u].pb({v, i});
		G[v].pb({u, i});
	}
	for (int i=0; i<m; i++){
		int u=getpar(E[i].second.first), v=getpar(E[i].second.second);
		if (u!=v){
			par[u]=v;
			W[v]+=W[u];	
		}
//		debug2(i, W[v])
		good[i]=(W[v]>=E[i].first);
	}
	for (int i=m-1; ~i; i--) if (good[i]) dfs(E[i].second.first, i);//, debug(i);
	cout<<m-ans<<"\n";
	
	return 0;
}
