#include <bits/stdc++.h>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (long long i = (n) - 1; i >= 0; i--)
#define foreach(it,ar) for ( typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++ )
#define fill(ar,val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i,0,(n)) ar[i] = INF
#define debug(x) cout<<#x<<": "<<x<<endl
#define arr1d(a,n) cout << #a << " : "; fr(_,1,n) cout << a[_] << ' '; cout << endl;
#define arr1d0(a,n) cout << #a << " : "; rep(_,n) cout << a[_] << ' '; cout << endl;
#define arr2d(a,n,m) cout << #a << " :" << endl; fr(_,1,n) {fr(__,1,m) cout << a[_][__] << ' '; cout << endl;}
#define arr2d0(a,n,m) cout << #a << " :" << endl; rep(_,n) {rep(__,m) cout << a[_][__] << ' '; cout << endl;}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
 // to_string(nnn) // substr(m, n) // stoi(nnn)
 // do { } while ( next_permutation(A, A+xxx) ) ;
// auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#define ull unsigned long long
#define ll long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
#define y1 yyyyyy1
#define sot(bello) bello.begin(),bello.end()
#define BIT(n) (1<<(n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) {return fabs(a - b) < 1e-9;}

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;


template<typename T>inline T gcd(T a, T b){if (b == 0)return a;else return gcd(b, a % b);}
template<typename T>inline T lcm(T a, T b){return (a * b) / gcd(a, b);}
template<typename T> string toStr(T x) {stringstream st; st << x; string s; st >> s; return s;}
template<class T>
void splitStr(const string &s, vector<T> &out)
{
    istringstream in(s);
    out.clear();
    copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}

inline int two(int n) {return 1 << n;}
inline int isOnBit(int n, int b) {return (n >> b) & 1;}
inline void onBit(int & n, int b) {n |= two(b);}
inline void offBit(int & n, int b) {n &= ~two(b);}
inline int lastBit(int n) {return n & (-n);}
inline int cntBit(int n) {int res = 0; while(n && ++res) n -= n &(-n); return res;}

const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define INP "test.inp"
#define OUT "test.out"

#define PI 3.1415926535897932385
#define INF 1000000000000000000ll
#define EPS 1e-7
#define MAXN 100000
#define MOD 1000000007
#define dec decr
//END OF COMPETITVE PROGRAMMING TEMPLATE
ll gcd(ll a, ll b) 
{ 
    if (a == 0) 
        return b; 
    return gcd(b % a, a); 
} 
ll modexp(ll x, ll y, ll p)
{
    ll res = 1;   
    x = x % p;  
    while (y > 0)
    {
        if (y & 1)    
            res = (res*x) % p;
        y = y>>1;     
        x = (x*x) % p; 
    }
    return res;
}
ll dsu[100006];
ll sum[100006];
ll size[100006];
ll pend[100006];
vector<ll>v1[100006];
vector<pair<ll,pair<ll,ll>>>v;
int main () 
{
	ios_base::sync_with_stdio(false);
            cin.tie(NULL);
	    cout<<setprecision(11);
        ll n,m;
        cin>>n>>m;
        rep(i,n)
        {
            cin>>sum[i+1];
            v1[i].pb(i);
        }
        rep(i,n+1)
        {
            dsu[i]=i;
        }
        rep(i,m)
        {
            ll a,b,c;
            cin>>a>>b>>c;
            v.pb(mp(c,mp(a,b)));
        }
        sort(all(v));
        ll ans=0;
        for(ll i=0;i<m;i++)
        {
            ll x=v[i].ss.ff;
            ll y=v[i].ss.ss;
            ll z=v[i].ff;
            // debug(x);
            // debug(y);
            // debug(z);
            // debug(ans);
            if(size[dsu[x]]>size[dsu[y]])
            {
                swap(x,y);
            }
            if(dsu[x]==dsu[y])
            {
                if(sum[dsu[x]]>=z)
                {
                    ans+=pend[dsu[x]]+1;
                    pend[dsu[x]]=0;
                }
                else
                {
                    pend[dsu[x]]++;
                }
            }
            else
            {
                ll d1=dsu[x],d2=dsu[y];
                size[d2]+=size[d1];
                sum[d2]+=sum[d1];
                pend[d2]+=pend[d1];
                // debug(sum[d2]);
                rep(kk,v1[d1].size())
                {
                    v1[d2].pb(v1[d1][kk]);
                    dsu[v1[d1][kk]]=d2;
                }
                if(sum[d2]>=z)
                {
                    ans+=pend[dsu[d2]]+1;
                    pend[dsu[d2]]=0;
                }
                else
                {
                    pend[dsu[d2]]++;
                }
            }
            // debug(ans);
        }

        cout<<m-ans;
        return 0;
}