#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<vi> vvi;
typedef std::vector<ll> vll;
typedef std::vector<vll> vvll;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int n, m;
class UF {
private:
  vector<ll> data; // parent or size
  vector<int> next;
  vector<int> last;
  void init(int n) {
    data.assign(n, -1);
    next.assign(n, -1);
    last.resize(n);
    for (int i = 0; i < n; ++i) {
      last[i] = i;
    }
  }

public:
  UF() {}
  UF(int n) {
    init(n);
  }
  bool apply_x(vll& x) {
    rep (i, n) {
      data[i] = -x[i];
    }
    return true;
  }
  int root(int x) {
    if (data[x] < 0) return x;
    return data[x] = root(data[x]);
  }
  bool unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y); // data[x] and data[y] are negative.
    data[x] += data[y];
    data[y] = x;
    next[last[x]] = y;
    last[x] = last[y];
    return true;
  }
  ll size(int x) {
    return -data[root(x)];
  }
  bool same(int x, int y) {
    return root(x) == root(y);
  }
  int get_next(int x) {
    return next[x];
  }
};

vll x;
vvll g;
vvec<vll> adj;

int main() {
  scan(n, m);
  x.resize(n);
  scan(x);
  g.resize(m);
  adj.resize(n);
  auto uf = UF(n);
  uf.apply_x(x);
  rep (i, m) {
    ll a, b, y;
    scan(a, b, y);
    a -= 1; b -= 1;
    g[i] = {y, a, b};
    adj[a].push_back({b, y});
    adj[b].push_back({a, y});
  }
  sort(all(g));
  vvll remaining_edges;
  rep (i, m) {
    uf.unite(g[i][1], g[i][2]);
    if (uf.size(g[i][1]) >= g[i][0]) {
      remaining_edges.push_back(g[i]);
    }
  }
  reverse(all(remaining_edges));
  //debug(remaining_edges);

  vll vl_max_cost(n, 0);
  for (auto&& me : remaining_edges) {
    if (vl_max_cost[me[1]] > 0) { continue; }
    ll max_cost = me[0];
    vl_max_cost[me[1]] = max_cost;
    deque<ll> q = {me[1]};
    while (!q.empty()) {
      ll u = q.front();
      q.pop_front();
      for (auto&& e : adj[u]) {
        if (e[1] > max_cost) { continue; }
        ll v = e[0];
        if (vl_max_cost[v] > 0) { continue; }
        vl_max_cost[v] = max_cost;
        //debug3(u, v, vl_max_cost[v]);
        q.push_back(v);
      }
    }
  }
  //debug(vl_max_cost);
  int ans = 0;
  rep (i, m) {
    if (g[i][0] > vl_max_cost[g[i][1]] || g[i][0] > vl_max_cost[g[i][2]]) {
      ans += 1;
    }
  }

  print(ans);

  return 0;
}


Measured memory_bytes: 29360