using System;
using System.Collections;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    struct Edge {
        public int Id, A, B, Weight;
    }

    public void Run() {
        var n = ni();
        var m = ni();
        var x = ni(n);
        var edges = E.Range(0, m)
            .Select(i => new Edge {
                Id = i,
                A = ni() - 1,
                B = ni() - 1,
                Weight = ni(),
            })
            .ToArray();

        var adj = E.Range(0, n).Select(_ => new List<Edge>()).ToArray();

        foreach (var e in edges) {
            adj[e.A].Add(e);
            adj[e.B].Add(e);
        }

        Array.Sort(edges, (e1, e2) => e1.Weight.CompareTo(e2.Weight));

        var sumWeight = new long[n];
        for (int i = 0; i < n; i++) {
            sumWeight[i] = x[i];
        }

        var disjointSet = new DisjointSet(n);
        var candidates = new List<Edge>();

        foreach (var es in edges
            .GroupBy(ed => ed.Weight)
            .OrderBy(g => g.Key)) {
            foreach (var e in es) {
                var g1 = disjointSet.Root(e.A);
                var g2 = disjointSet.Root(e.B);
                if (disjointSet.Unite(e.A, e.B)) {
                    sumWeight[g1] = sumWeight[g2] = sumWeight[g1] + sumWeight[g2];
                }
            }
            foreach (var e in es) {
                var g = disjointSet.Root(e.A);
                var sumW = sumWeight[g];
                if (sumW >= e.Weight) { // candidate
                    candidates.Add(e);
                }
            }
        }

        var isChoose = new bool[m];
        var visited = new BooleanArray(n);

        foreach (var e in candidates.AsEnumerable().Reverse()) {
            if (!isChoose[e.Id]) {
                var queue = new Queue<int>();
                queue.Enqueue(e.A);
                queue.Enqueue(e.B);
                isChoose[e.Id] = true;
                visited.Clear();
                while (queue.Count > 0) {
                    var current = queue.Dequeue();
                    if (visited[current]) continue;
                    visited[current] = true;
                    foreach (var edge in adj[current]) {
                        if (edge.Weight <= e.Weight) {
                            isChoose[edge.Id] = true;
                            var next = edge.A == current ? edge.B : edge.A;
                            queue.Enqueue(next);
                        }
                    }
                }
            }
        }

        var ans = m - isChoose.Count(t => t);
        cout.WriteLine(ans);
    }

}

public class BooleanArray {
    private readonly int[] array;
    private int trueValue = 1;

    public BooleanArray(int size) {
        array = new int[size];
    }

    public void Clear() {
        trueValue++;
    }

    public bool this[int index] {
        get {
            return array[index] == trueValue;
        }
        set {
            array[index] = value ? trueValue : trueValue - 1;
        }
    }

    public int Length {
        get {
            return array.Length;
        }
    }
}
public class DisjointSet {
    private readonly int[] group;
    public int GroupCount { get; private set; }
    public DisjointSet(int n) {
        group = new int[n];
        Clear();
        GroupCount = n;
    }
    public bool Unite(int x, int y) {
        x = Root(x); y = Root(y);
        if (x == y) {
            return false;
        }

        if (group[y] < group[x]) {
            return Unite(y, x);
        }

        group[x] += group[y];
        group[y] = x;
        GroupCount--;
        return true;
    }
    public bool IsSameSet(int x, int y) { return Root(x) == Root(y); }
    public int Root(int x) { return group[x] < 0 ? x : group[x] = Root(group[x]); }
    public int Size(int x) { return -group[Root(x)]; }
    public void Clear() {
        for (int i = 0; i < group.Length; i++) {
            group[i] = -1;
        }
    }
};

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        Console.SetIn(new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length));
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 54664