#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long int;
const ll MD = 1000000007ll;
const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) {
  if (!assertion) {
    cerr << "assertion fault:" << endl;
    f();
    abort();
  }
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2> p) {
  o << '(' << p.first << ':' << p.second << ')';
  return o;
}
template <typename Vec>
inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
  os << '[';
  for (const auto& e : a) os << ' ' << e << ' ';
  os << ']';
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& o, const vector<T>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T, size_t S>
inline ostream& operator<<(ostream& o, const array<T, S>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T>
inline T& chmax(T& to, const T& val) {
  return to = max(to, val);
}
template <typename T>
inline T& chmin(T& to, const T& val) {
  return to = min(to, val);
}
void bye(string s, int code = 0) {
  cout << s << endl;
  exit(code);
}
mt19937_64 randdev(8901016);
template <typename T, typename Random = decltype(randdev),
          typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) {
  return uniform_int_distribution<T>(l, h)(rand);
}
template <typename T, typename Random = decltype(randdev),
          typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) {
  return uniform_real_distribution<T>(l, h)(rand);
}
namespace {
class MaiScanner {
 public:
  template <typename T>
  void input_integer(T& var) noexcept {
    var = 0;
    T sign = 1;
    int cc = getchar_unlocked();
    for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getchar_unlocked(); }
  inline MaiScanner& operator>>(int& var) noexcept {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner& operator>>(long long& var) noexcept {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner& operator>>(string& var) {
    int cc = getchar_unlocked();
    for (; !(0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      ;
    for (; (0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      var.push_back(cc);
    return *this;
  }
  template <typename IT>
  inline void in(IT begin, IT end) {
    for (auto it = begin; it != end; ++it) *this >> *it;
  }
};
class MaiPrinter {
 public:
  template <typename T>
  void output_integer(T var) noexcept {
    if (var == 0) {
      putchar_unlocked('0');
      return;
    }
    if (var < 0) putchar_unlocked('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var) stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p) putchar_unlocked(stack[--stack_p]);
  }
  inline MaiPrinter& operator<<(char c) noexcept {
    putchar_unlocked(c);
    return *this;
  }
  inline MaiPrinter& operator<<(int var) noexcept {
    output_integer<int>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(long long var) noexcept {
    output_integer<long long>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(char* str_p) noexcept {
    while (*str_p) putchar_unlocked(*(str_p++));
    return *this;
  }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putchar_unlocked(*p++);
    return *this;
  }
  template <typename IT>
  void join(IT begin, IT end, char sep = ' ') {
    for (bool b = 0; begin != end; ++begin, b = 1)
      b ? *this << sep << *begin : *this << *begin;
  }
};
}  // namespace
MaiScanner scanner;
MaiPrinter printer;
class GraphE {
 public:
  using W_T = int;
  struct Edge {
    int u, v;
    W_T value;
    Edge(int from = 0, int to = 0, W_T value = 0)
        : u(from), v(to), value(value) {}
    inline int to(int _v) const { return _v == v ? u : v; }
  };
  size_t n;
  vector<vector<int>> vertex_to;
  vector<Edge> edges;
  GraphE(int n = 1) : n(n), vertex_to(n) {}
  inline size_t size() const noexcept { return n; }
  void resize(size_t _n) { vertex_to.resize(n = _n); }
  void connect(int from, int to, W_T val = 0) {
    vertex_to[(size_t)from].push_back((int)edges.size());
    vertex_to[(size_t)to].push_back((int)edges.size());
    edges.emplace_back(from, to, val);
  }
  void connect(vector<Edge>&& es) {
    edges = move(es);
    for (int i = 0; (size_t)i < edges.size(); ++i) {
      vertex_to[edges[i].u].push_back(i);
      vertex_to[edges[i].v].push_back(i);
    }
  }
};
class Unionfind {
 public:
  vector<int> data;
  Unionfind(size_t size) : data(size, -1) {}
  bool connect(size_t x, size_t y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y];
      data[y] = (int)x;
    }
    return x != y;
  }
  inline bool same(size_t x, size_t y) { return root(x) == root(y); }
  inline size_t root(size_t x) {
    return (size_t)(data[x] < 0 ? x : data[x] = root(data[x]));
  }
  inline int size(size_t x) { return -data[root(x)]; }
};
int N, M;
const int H = MD;
GraphE graph;
vector<GraphE::Edge> edges;
int W[100010];
char eFlg[100010];
int bound;
void markdfs(int idx) {
  for (int i : graph.vertex_to[idx]) {
    if (eFlg[i] == 1 || graph.edges[i].value > bound) continue;
    eFlg[i] = 1;
    markdfs(graph.edges[i].to(idx));
  }
}
int main() {
  scanner >> N >> M;
  graph.resize(N);
  edges.reserve(M + 2);
  graph.edges.reserve(M + 2);
  scanner.in(W, W + N);
  for (auto i = decltype(M)(); (i) < (M); ++(i)) {
    int a, b;
    ll c;
    scanner >> a >> b >> c;
    --a;
    --b;
    edges.emplace_back(a, b, c);
  }
  sort((edges).begin(), (edges).end(),
       [](GraphE::Edge l, GraphE::Edge r) { return l.value < r.value; });
  graph.connect(move(edges));
  Unionfind uf(N);
  for (auto i = decltype(M)(); (i) < (M); ++(i)) {
    auto edge = graph.edges[i];
    int ur = uf.root(edge.u);
    int vr = uf.root(edge.v);
    if (uf.connect(edge.u, edge.v)) W[uf.root(edge.u)] = min(H, W[ur] + W[vr]);
    if (W[uf.root(edge.u)] >= edge.value) {
      bound = edge.value;
      eFlg[i] = 1;
      markdfs(edge.u);
      markdfs(edge.v);
    }
  }
  int ans = 0;
  for (auto i = decltype(M)(); (i) < (M); ++(i)) {
    ans += eFlg[i] == 0;
  }
  cout << ans << endl;
  return 0;
}
