#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int pre[11000];
int point[11000];
struct Edge
{
int x,y,w;
}edge[110000];
int n,m;
int cmp(Edge a,Edge b)
{
return a.w<b.w;
}
int find(int x)
{
if(pre[x]==x)
return x;
int t=find(pre[x]);
pre[x]=t;
return t;
}
int main()
{
int i;
while( scanf("%d%d",&n,&m)!=EOF )
{
int mmin=10000;
for(i=1;i<=n;i++)
{
pre[i]=i;
scanf("%d",&point[i]);
mmin=min(mmin,point[i]);
}
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
edge[i].w=edge[i].w*2+point[edge[i].x]+point[edge[i].y];
}
sort(edge+1,edge+m+1,cmp);
int sum=0;
for(i=1;i<=m;i++)
{
int fx=find(edge[i].x);
int fy=find(edge[i].y);
if(fx!=fy)
{
sum=sum+edge[i].w;
pre[fx]=fy;
}
}
printf("%d\n",sum+mmin);
}
return 0;
}
08-05
08-05
08-05
08-05