#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

vector<ll> x;

struct UnionFind{
    vector<int> p,r;
    vector<ll> sum; // ノードの和
    vector<int> cnt;
    UnionFind(){}
    UnionFind(int n){ init(n); }

    void init(int n){
        p.resize(n,-1);
        r.resize(n,0);
        sum.resize(n,0);
        cnt.resize(n,0);
        for(int i=0;i<n;i++) sum[i] = x[i];
    }

    int find(int x){
        if(p[x] < 0) return x;
        else return p[x] = find(p[x]);
    }

    void merge(int x,int y){
        x = find(x);
        y = find(y);
        if(x==y) return;
        if(r[x] < r[y]){    // y <-- x
            p[x] = y;
            r[x]++;
            sum[y] += sum[x];
            sum[x] = 0;
            cnt[y] += cnt[x];
            cnt[x] = 0;
        }else{ // x <-- y
            p[y] = x;
            if(r[x] == r[y]) r[x]++;
            r[y]++; 
            sum[x] += sum[y];
            sum[y] = 0;
            cnt[x] += cnt[y];
            cnt[y] = 0;
        }
    }

    ll get(int x){
        return sum[find(x)];
    }

    void inc(int x){
        cnt[find(x)]++;
    }

    int add(int x){
        x = find(x);
        int ret = cnt[x];
        cnt[x] = 0;
        return ret;
    }
};

using Pair = pair<int,int>;
using Edge = pair<ll,Pair>;
vector<Edge> es;

int main(){
    int n,m; cin >> n >> m;
    x.resize(n); rep(i,n) cin >> x[i];
    es.resize(m);
    rep(i,m){
        int a,b; ll y; cin >> a >> b >> y;
        a--;b--;
        es[i] = Edge(y,Pair(a,b));
    }
    sort(all(es));

    ll ans = 0;
    UnionFind uf(n);
    rep(i,m){
        uf.merge(es[i].second.first,es[i].second.second);
        if(uf.get(es[i].second.first) < es[i].first){ // NG
            uf.inc(es[i].second.first);
        }else{  // OK
            uf.inc(es[i].second.first);
            ans += uf.add(es[i].second.first);
        }
    }

    cout << m - ans << endl;
}


Measured memory_bytes: 4608