#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
int x[100010];
struct UnionFind{
    vector<int>par,siz;
    UnionFind(int n){
        par.resize(n);
        siz.resize(n);
        rep(i,n){
            par[i]=i;
            siz[i]=x[i];
        }
    }
    int find(int x){
        if(par[x]==x)return x;
        return par[x]=find(par[x]);
    }
    void unite(int x,int y){
        x=find(x),y=find(y);
        if(x==y)return;
        if(siz[x]<siz[y])swap(x,y);
        par[y]=x;
        siz[x]+=siz[y];
    }
    bool same(int x,int y){
        return find(x)==find(y);
    }
    int size(int x){
        return siz[find(x)];
    }
};
int n,m,ans;
struct edge{int u,v,cost;bool opt,used;};
bool comp(const edge &e1,const edge &e2){
    return e1.cost<e2.cost;
}
bool used[100010];
edge e[100010];
struct Edge{int to,cost,id;};
vector<Edge>G[100010];
void dfs(int x,int ma){
    used[x]=true;
    for(Edge E:G[x]){
        if(used[E.to])continue;
        if(E.cost>ma)continue;
        e[E.id].used=true;
        dfs(E.to,ma);
    }
}
signed main(){
    cin.tie(0);ios::sync_with_stdio(false);
    cin>>n>>m;
    rep(i,n)cin>>x[i];
    rep(i,m){
        cin>>e[i].u>>e[i].v>>e[i].cost;
        e[i].u--,e[i].v--;
        e[i].opt=false;
        e[i].used=false;
    }
    sort(e,e+m,comp);
    UnionFind uf(n);
    rep(i,m){
        uf.unite(e[i].u,e[i].v);
        if(uf.size(e[i].u)>=e[i].cost)e[i].opt=true;
    }
    reverse(e,e+m);
    rep(i,m){
        G[e[i].u].pb({e[i].v,e[i].cost,i});
        G[e[i].v].pb({e[i].u,e[i].cost,i});
    }
    rep(i,m){
        if(!e[i].used&&!used[e[i].u]){
            if(e[i].opt){
                dfs(e[i].u,e[i].cost);
            }
            else ans++;
        }
        e[i].used=true;
    }
    cout<<ans<<endl;
    return 0;
}


Measured memory_bytes: 22032