/*** Template Begin ***/

#pragma region template

#define USING_NAMESPACE

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

typedef int64_t i64;
typedef uint64_t u64;

auto init_ = [] {
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed;
    return 0;
}();

template <typename T>
inline void in(T &x) {
    std::cin >> x;
}

template <typename T, typename... Ts>
inline void in(T &t, Ts &... ts) {
    std::cin >> t;
    in(ts...);
}

template <typename T, typename U = std::vector<T>>
inline U vin(int n) {
    U v(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> v[i];
    }
    return v;
}

template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
    V vv(h, U(w));
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            std::cin >> vv[i][j];
        }
    }
    return vv;
}

template <char delimiter = ' ', typename T>
inline void out(const T &x) {
    std::cout << x << std::endl;
}

template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &... ts) {
    std::cout << t << delimiter;
    out<delimiter>(ts...);
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
    for (int i = 0; i < n; ++i) {
        if (i) std::cout << delimiter;
        std::cout << v[i];
    }
    std::cout << std::endl;
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (j) std::cout << delimiter;
            std::cout << v[i][j];
        }
        std::cout << std::endl;
    }
}

template <typename T, size_t D>
struct multi_vector_type {
    using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};

template <typename T>
struct multi_vector_type<T, 1> {
    using type = std::vector<T>;
};

template <typename T>
struct multi_vector_type<T, 0> {
    using type = T;
};

template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;

template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
    return val;
}

template <typename T, size_t D = 1, typename... Ts,
          class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&... args) {
    return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}

namespace detail {

template <typename F>
struct Debug {
    const char *delim_ = "\n";
    F fun;

    Debug(F f) : fun(f) {}

    ~Debug() { fun(delim_); }

    Debug &delim(const char *d) {
        delim_ = d;
        return *this;
    }
};

std::deque<std::string> split(const std::string &s, char c) {
    std::deque<std::string> v;
    std::stringstream ss(s);
    std::string x;
    while (std::getline(ss, x, c)) v.emplace_back(x);
    return v;
}

template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
    std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
              << '\n';
    std::cerr << std::flush;
}

template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
    std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
              << delim;
    v.pop_front();
    deb(delim, std::move(v), args...);
}

template <typename... Args>
auto wrap(std::deque<std::string> v, Args... args) {
    auto f = [=](const char *delim = "\n") { deb(delim, v, args...); };

    return Debug<decltype(f)>(f);
}
}

#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)

#ifdef USING_BOOST

#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>

inline auto rep(int begin, int end) {
    if (begin > end) {
        return boost::irange(0, 0);
    } else {
        return boost::irange(begin, end);
    }
}

inline auto rep(int begin, int end, int step) {
    if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
        return boost::irange(0, 0, step);
    } else {
        return boost::irange(begin, end, step);
    }
}

#endif

#ifdef USING_NAMESPACE
using namespace std;

#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif

#pragma endregion

/*** Template End ***/

#define fst first
#define snd second
#define all(c) ((c).begin()), ((c).end())

template <class T>
struct WeightedUnionFind {
  struct Data {
    int parent = -1;
    T value = 0, delta = 0, total = 0;
  };
  vector<Data> data;
  WeightedUnionFind(int n) : data(n) { }

  void add(int u, T a) {
    data[u].value += a;
    data[root(u)].total += a;
  }
  void addSet(int u, T a) {
    data[root(u)].delta += a;
    data[root(u)].total -= data[root(u)].parent * a;
  }
  T get(int u) {
    return data[u].value + root_(u).snd;
  }
  T getSet(int u) {
    return data[root(u)].total;
  }
  bool unite(int u, int v) { 
    u = root(u); v = root(v);
    if (u == v) return false;
    if (data[u].parent > data[v].parent) swap(u, v);
    data[u].parent += data[v].parent; 
    data[v].parent = u;
    data[v].delta -= data[u].delta;
    data[u].total += data[v].total;
    return true;
  }
  pair<int, T> root_(int u) {
    if (data[u].parent < 0) return {u, data[u].delta};
    auto p = root_(data[u].parent);
    p.snd += data[u].delta;
    data[u].parent = p.fst;
    data[u].delta = p.snd - data[p.fst].delta;
    return p;
  }
  int root(int u) { return root_(u).fst; } 
  bool find(int u, int v) { 
    return root(u) == root(v); 
  }
  int size(int u) { 
    return -data[root(u)].parent;
  }
};

struct Edge {
    int from, to;
    i64 w;
};

int main() {
    int n, m;
    in(n, m);

    auto x = vin<i64>(n);

    vector<Edge> es(m);

    for (auto& e : es) {
        in(e.from, e.to, e.w);
        e.from--;
        e.to--;
    }

    sort(es.begin(), es.end(), [](auto a, auto b){return a.w > b.w;});
    vector<bool> removed(m);

    int ans = 0;

    // while(true) {
    //     bool update = false;

    //     WeightedUnionFind<i64> uf(n);

    //     for (int i = 0; i < n; i++) {
    //         uf.add(i, x[i]);
    //     }

    //     for (int i = 0; i < m; i++) {
    //         if (removed[i]) {
    //             continue;
    //         }

    //         auto e = es[i];
    //         uf.unite(e.from, e.to);
    //     }

    //     for (int i = 0; i < m; i++) {
    //         if (removed[i]) {
    //             continue;
    //         }

    //         auto e = es[i];

    //         if (e.w > uf.getSet(e.from)) {
    //             removed[i] = true;
    //             update = true;
    //             ans++;

    //             break;
    //         }
    //     }

    //     if (!update) {
    //         break;
    //     }
    // }

    WeightedUnionFind<i64> uf(n);

    for (int i = 0; i < n; i++) {
        uf.add(i, x[i]);
    }
    
    for (int i = 0; i < m; i++) {
        auto e = es[i];
        uf.unite(e.from, e.to);
    }
    
    vector<int> ok(n);

    for (int i = 0; i < m; i++) {
        if (ok[es[i].from] || ok[es[i].to]) {
            continue;
        }

        if (es[i].w > uf.getSet(es[i].from)) {
            uf = WeightedUnionFind<i64>(n);

            for (int i = 0; i < n; i++) {
                if (!ok[i]) {
                    uf.add(i, x[i]);
                }
            }

            for (int j = i + 1; j < m; j++) {
                uf.unite(es[j].from, es[j].to);
            }

            ans++;
        } else {
            for (int i = 0; i < n; i++) {
                if (uf.find(es[i].from, i)) {
                    ok[i] = true;
                }
            }
        }
    }

    out(ans);
}