#include<stdio.h>
#include<algorithm>
using namespace std;
struct edge{
	int x,y,v;
	edge(int a=0,int b=0,int c=0){x=a;y=b;v=c;}
}e[2000010];
int hi[100010],h[100010],to[2000010],nex[2000010],q[2000010],fa[100010],M;
bool v[100010];
int get(int x){return(fa[x]==x)?x:(fa[x]=get(fa[x]));}
void add(int a,int b,int c){
	M++;
	to[M]=b;
	nex[M]=h[a];
	h[a]=M;
	e[M]=edge(a,b,c);
}
bool cmp(edge a,edge b){return(hi[a.y]==hi[b.y])?(a.v<b.v):(hi[a.y]>hi[b.y]);}
int main(){
	int n,m,i,x,y,z,head,tail;
	long long ans;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)scanf("%d",hi+i);
	for(i=1;i<=m;i++){
		scanf("%d%d%d",&x,&y,&z);
		if(hi[x]>=hi[y])add(x,y,z);
		if(hi[x]<=hi[y])add(y,x,z);
	}
	head=tail=1;
	q[1]=1;
	while(head<=tail){
		x=q[head];
		head++;
		v[x]=1;
		for(i=h[x];i;i=nex[i]){
			if(!v[to[i]]){
				tail++;
				q[tail]=to[i];
			}
		}
	}
	x=0;
	for(i=1;i<=n;i++)x+=v[i];
	printf("%d\n",x);
	for(i=1;i<=n;i++)fa[i]=i;
	sort(e+1,e+M+1,cmp);
	ans=0;
	for(i=1;i<=M;i++){
		if(!v[e[i].x]||!v[e[i].y])continue;
		x=get(e[i].x);
		y=get(e[i].y);
		if(x!=y){
			fa[x]=y;
			ans+=e[i].v;
		}
	}
	printf("%lld",ans);
}