1900分图论：1095F 贪心构造+最小生成树

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

int n , m, rt;
ll ans = 0;
struct node
{
    int u , v;
    ll w;
    bool operator <  (const node& no) const{
        return w < no.w;
    }
}edge[2*200005];
ll vertex[200005], c[200005];
int fa[200005];
int findroot(int x)
{
    if(fa[x] == x)
        return x;
    return fa[x] = findroot(fa[x]);
}
bool merge(int x, int y)
{
    int fax = findroot(x);
    int fay = findroot(y);
    if(fax != fay)
    {
        fa[fax] = fay;
        return true;
    }
    return false;
}
ll kruskal()
{
    ll ans = 0;
    int tot = 0;
    for (int i = 1 ; i <= m ; i ++)
    {
        if(tot == n - 1)
            return ans;
        int u = edge[i].u , v = edge[i].v;
        ll w = edge[i].w;
        if(merge(u,v))
        {
            tot += 1;
            ans += w;
        }
    }
    return ans;
}
int main(void)
{
    CLOSE;
    ll maxn = 1e13;
    cin >> n >> m;
    for (int i = 1 ; i <= n ; i ++) {
        cin >> vertex[i], fa[i] = i;
        if(vertex[i] < maxn)
        {
            maxn = vertex[i];
            rt = i;
        }
    }
    for (int i = 1 ; i <= m ; i ++)
        cin >> edge[i].u >> edge[i].v >> edge[i].w;
    for (int i = 1 ; i <= n ; i ++)
    {
        if(rt == i) continue;
        edge[++ m].u = rt, edge[m].v = i, edge[m].w = vertex[rt] + vertex[i];
    }
    sort (edge + 1, edge + 1 + m);
    cout << kruskal() << endl;
}
/*
8 8 3
3 3 3
3.2.....
........
........
........
........
..1.....
........
........


5 5 2
3 2
..1..
..2..
.....
.....
.....
 */