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

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << endl
#define p7(a, b, c, d, e, f, g) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                         \
    idp                                    \
    {                                      \
        rep(i, n) { cout << x[i] << " "; } \
        puts("");                          \
    }
#define dump2(x, n)                                                     \
    idp                                                                 \
    {                                                                   \
        rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
        puts("");                                                       \
    }
#define dumpi(x)                  \
    idp                           \
    {                             \
        foreach (it, x)           \
        {                         \
            cout << (*it) << " "; \
        }                         \
        puts("");                 \
    }
#define dumpi2(x)                                               \
    idp                                                         \
    {                                                           \
        foreach (it, x)                                         \
        {                                                       \
            cout << "[" << (it)->F << " , " << (it)->S << "] "; \
        }                                                       \
        puts("");                                               \
    }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                   \
    rep(i, h)                             \
    {                                     \
        rep(j, w) cout << a[i][j] << " "; \
        puts("");                         \
    }

typedef pair<li, li> PI;

#define UF_NUM 505050
li parent[UF_NUM];

li n, m;
li x[101010];
li sx[101010];
pair<li, PI> links[101010];

// {to, {weight, id}}
vector<pair<li, PI>> edges[100100];
bool use[101010];
bool cand[101010];
bool visited[100100];

inline void init_uf() {
    rep(i, UF_NUM)parent[i] = i;
}

inline li find(li x) {
    if (parent[x] == x)return x;
    else return (parent[x] = find(parent[x]));
}


inline void union_(li x, li y) {
    li parent_x = find(x);
    li parent_y = find(y);
    parent[parent_x] = parent_y;
}

int main() {
    cin >> n >> m;
    rin{
        cin >> x[i];
        use[i] = false;
        cand[i] = false;
        visited[i] = false;
        sx[i] = x[i];
    }
    rep(i, m) {
        li a, b, y;
        cin >> a >> b >> y;
        a--;
        b--;
        links[i] = {y, {a, b}};
    }
    sort(links, links + m);
    rep(i, m) {
        edges[links[i].S.F].pb({links[i].S.S, {links[i].F, i}});
        edges[links[i].S.S].pb({links[i].S.F, {links[i].F, i}});
    }
    init_uf();
    rep(i, m) {
        if (find(links[i].S.F) != find(links[i].S.S)) {
            li sum = sx[find(links[i].S.F)] + sx[find(links[i].S.S)];
            union_(find(links[i].S.F), find(links[i].S.S));
            sx[find(links[i].S.F)] = sum;
        }
        if (sx[find(links[i].S.F)] >= links[i].F) {
            cand[i] = true;
        }
    }

    li res = 0;
    for (li i = m - 1; i >= 0; --i) {
        if (use[i]) continue;
        if (!cand[i]) {
            ++res;
            continue;
        }

        // dfs
        stack<li> stk;
        li w_lim = links[i].F;
        stk.push(links[i].S.F);
        stk.push(links[i].S.S);
        use[i] = true;
        while (!stk.empty()) {
            li now = stk.top();
            stk.pop();
            if (visited[now])continue;
            visited[now] = true;
            for (auto && link : edges[now]) {
                li next = link.F;
                li w = link.S.F;
                li idx = link.S.S;
                if (w > w_lim || use[idx]) {
                    continue;
                }
                use[idx] = true;
                stk.push(next);
            }
        }
    }

    cout << res << endl;

    return 0;
}

Measured memory_bytes: 18688