#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;

struct UnionFind
{
    vector<int> par, sz;
    UnionFind(int n) {
        par.resize(n);
        sz.resize(n, 1);
        for (int i = 0; i < n; ++i) par[i] = i;
    }
    int root(int x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (sz[x] < sz[y]) swap(x, y);
        par[y] = x;
        sz[x] += sz[y];
        sz[y] = 0;
        return true;
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    int size(int x) {
        return sz[root(x)];
    }
};

int main()
{
    while (true) {
        int n, m; cin >> n >> m;
        if (n == 0 && m == 0) {
            break;
        }
        vector<int> h(n); cin >> h;
        Edges<int> E;
        for (int i = 0; i < m; ++i) {
            int a, b, c; cin >> a >> b >> c; --a, --b;
            E.emplace_back(a, b, c);
        }

        vector<vector<int>> idx;
        {
            map<int,vector<int>> mp;
            for (int i = 0; i < n; ++i) {
                mp[-h[i]].push_back(i);
            }
            for (auto p : mp) {
                idx.push_back(p.sc);
            }
        }

        int pivot = -1;
        for (int i = idx.size()-1; i >= 0; --i) {
            vector<bool> used(n, false);
            for (int j = 0; j <= i; ++j) {
                for (auto id : idx[j]) {
                    used[id] = true;
                }
            }

            Edges<int> es;
            for (auto e : E) {
                if (used[e.src] && used[e.to]) {
                    es.push_back(e);
                }
            }

            UnionFind uf(n);
            for (auto e : es) {
                if (!uf.issame(e.src, e.to)) {
                    uf.merge(e.src, e.to);
                }
            }
            map<int,bool> mp;
            for (int i = 0; i < n; ++i) if (used[i]) {
                mp[uf.root(i)] = true;
            }

            if (mp.size() != 1) {
                pivot = i;
                break;
            }
        }

        UnionFind uf(n);
        vector<bool> used(n, false);
        for (int i = 0; i <= pivot; ++i) {
            for (auto id : idx[i]) {
                used[id] = true;
            }
        }

        int total = 0;
        for (int i = pivot+1; i < idx.size(); ++i) {
            for (auto id : idx[i]) {
                used[id] = true;
            }

            Edges<int> es;
            for (auto e : E) {
                if (used[e.src] && used[e.to]) {
                    es.push_back(e);
                }
            }

            int sz = es.size();
            vector<int> ord(sz);
            iota(ord.begin(), ord.end(), 0);
            sort(ord.begin(), ord.end(), [&](int i, int j) {
                    return es[i].cost < es[j].cost;
                    });

            int sum = 0;
            for (auto i : ord) {
                if (!uf.issame(es[i].src, es[i].to)) {
                    uf.merge(es[i].src, es[i].to);
                    sum += es[i].cost;
                }
            }
            total += sum;
        }

        cout << total << endl;
    }

    return 0;
}



Measured memory_bytes: 3976