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

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

struct UnionFind{
	vi par,x;
	vector<vector<pi>> waf;
	
	UnionFind(vi xx){
		par.resize(xx.size(),-1);
		x=xx;
		waf.resize(xx.size());
	}

	int Find(int a){
		return par[a]==-1?a:(par[a]=Find(par[a]));
	}

	bool Same(int a,int b){
		return Find(a)==Find(b);
	}

	int Unite(int a,int b){
		a=Find(a);
		b=Find(b);
		if(a==b)return a;
		if(waf[a].size()<waf[b].size())
			swap(a,b);
		waf[a].insert(waf[a].end(),ALL(waf[b]));
		par[b]=a;
		x[a]+=x[b];
		return a;
	}
	
	int Size(int a){
		return x[Find(a)];
	}
};

signed main(){
	int n=read(),m=read();
	vi x(n);
	REP(i,n)
		x[i]=read();
	vector<tuple<int,int,int>> es;
	REP(i,m){
		int a=read()-1,b=read()-1,c=read();
		es.EB(c,a,b);
	}
	sort(ALL(es));
	UnionFind uf(x);
	UnionFind uf2(x);
	for(auto e:es){
		int c=get<0>(e),a=get<1>(e),b=get<2>(e);
		if(!uf.Same(a,b)){
			int root=uf.Unite(a,b);
			uf.waf[root].PB(pi(a,b));
			if(uf.Size(root)>=c){
				for(auto f:uf.waf[root])
					uf2.Unite(f.first,f.second);
				uf.waf[root].clear();
			}
		}
	}
	int ans=m;
	for(auto e:es){
		int c=get<0>(e),a=get<1>(e);
		if(uf2.Size(a)>=c)
			ans--;
	}
	print(ans);
}


Measured memory_bytes: 24772