#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define int long long

using namespace std;

typedef pair<int,int> P;
typedef pair<P,ll> pl;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

set<int> G[MAX_N];
ll x[MAX_N];
bool visit[MAX_N];
bool ed[MAX_N];
vector<pl> info;

void dfs(int u, set<int>& es, vi& ver, ll& sm)
{
    visit[u] = true;
    sm += x[u];
    ver.pb(u);
    each(p,G[u]){
        es.insert(p);
        int v = (info[p].fi).se;
        if(!visit[v]){
            dfs(v, es, ver, sm);
        }
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    rep(i,n){
        cin >> x[i];
    }
    info.resize(m);
    rep(i,m){
        int a,b,y;
        cin >> a >> b >> y;
        info[i] = pl(P(a-1,b-1),y);
        G[a-1].insert(i), G[b-1].insert(i);
    }
    int ans = 0;
    while(1){
        rep(i,n){
            visit[i] = false;
        }
        rep(i,n){
            if(!visit[i] && !ed[i]){
                set<int> es;
                vector<int> ver;
                ll val = 0;
                dfs(i, es, ver, val);
                int res = 0;
                each(p, es){
                    int u = (info[p].fi).fi, v = (info[p].fi).se;
                    if(val < info[p].se){
                        G[u].erase(p), G[v].erase(p);
                        res++;
                    }
                }
                if(res == 0){
                    each(v,ver){
                        ed[v] = true;
                    }
                }
                ans += res;
            }
        }
        bool br = true;
        rep(i,n){
            if(!ed[i]){
                br = false;
                break;
            }
        }
        if(br) break;
    }
    cout << ans << "\n";
    return 0;
}