import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 29);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            EWeightsOnVerticesAndEdges solver = new EWeightsOnVerticesAndEdges();
            solver.solve(1, in, out);
            out.close();
        }
    }

    static class EWeightsOnVerticesAndEdges {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.readInt();
            int m = in.readInt();
            int[] vertex = new int[n];
            in.populate(vertex);
            Edge[] edges = new Edge[m];
            for (int i = 0; i < m; i++) {
                edges[i] = new Edge();
                edges[i].a = in.readInt() - 1;
                edges[i].b = in.readInt() - 1;
                edges[i].w = in.readInt();
            }

            DSU dsu = new DSU(n);
            for (int i = 0; i < n; i++) {
                dsu.sum[i] = vertex[i];
            }

            Arrays.sort(edges, (a, b) -> Integer.compare(a.w, b.w));
            for (int i = 0; i < m; i++) {
                int r = i;
                while (r + 1 < m && edges[r + 1].w == edges[i].w) {
                    r++;
                }
                for (int j = i; j <= r; j++) {
                    Edge e = edges[j];
                    if (dsu.prev[dsu.find(e.a)] != null) {
                        dsu.prev[dsu.find(e.a)].next = e;
                        dsu.prev[dsu.find(e.a)] = null;
                    }
                    if (dsu.prev[dsu.find(e.b)] != null) {
                        dsu.prev[dsu.find(e.b)].next = e;
                        dsu.prev[dsu.find(e.b)] = null;
                    }
                    dsu.merge(e.a, e.b);
                    dsu.prev[dsu.find(e.b)] = e;
                }

                for (int j = i; j <= r; j++) {
                    Edge e = edges[j];
                    e.sum = dsu.sum[dsu.find(e.a)];
                }

                i = r;
            }

            for (int i = m - 1; i >= 0; i--) {
                Edge e = edges[i];
                if ((e.next == null || e.next.deleted) && e.sum < e.w) {
                    e.deleted = true;
                }
            }

            int ans = 0;
            for (Edge e : edges) {
                if (e.deleted) {
                    ans++;
                }
            }

            out.println(ans);
        }

    }

    static class Edge {
        int a;
        int b;
        int w;
        long sum;
        boolean deleted;
        Edge next;

    }

    static class FastInput {
        private final InputStream is;
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        public void populate(int[] data) {
            for (int i = 0; i < data.length; i++) {
                data[i] = readInt();
            }
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }

    static class FastOutput implements AutoCloseable, Closeable, Appendable {
        private StringBuilder cache = new StringBuilder(10 << 20);
        private final Writer os;

        public FastOutput append(CharSequence csq) {
            cache.append(csq);
            return this;
        }

        public FastOutput append(CharSequence csq, int start, int end) {
            cache.append(csq, start, end);
            return this;
        }

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput append(char c) {
            cache.append(c);
            return this;
        }

        public FastOutput append(int c) {
            cache.append(c);
            return this;
        }

        public FastOutput println(int c) {
            return append(c).println();
        }

        public FastOutput println() {
            cache.append(System.lineSeparator());
            return this;
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static class DSU {
        protected int[] p;
        protected int[] rank;
        protected Edge[] prev;
        protected long[] sum;

        public DSU(int n) {
            p = new int[n];
            rank = new int[n];
            prev = new Edge[n];
            sum = new long[n];
            reset();
        }

        public final void reset() {
            for (int i = 0; i < p.length; i++) {
                p[i] = i;
                rank[i] = 0;
            }
        }

        public final int find(int a) {
            if (p[a] == p[p[a]]) {
                return p[a];
            }
            return p[a] = find(p[a]);
        }

        public final void merge(int a, int b) {
            a = find(a);
            b = find(b);
            if (a == b) {
                return;
            }
            if (rank[a] == rank[b]) {
                rank[a]++;
            }

            if (rank[a] < rank[b]) {
                int tmp = a;
                a = b;
                b = tmp;
            }

            p[b] = a;
            sum[a] += sum[b];
        }

    }
}

