#4RE #1 #2 #3 #5WA,kruscal+dfs求条

#include<bits/stdc++.h>
using namespace std;
struct lin{
	long long cnt,to;
};
struct edge{
	long long l,r,val;
}e[1000001],s[1000001];
vector<lin> a[1000001];
long long vis[1000001];
long long n,cnt,m,a1[1000001];
void dfs(long long now){
	vis[now]=1;
	for(lin next:a[now]){
		long long to=next.to;
		if(!vis[to]){
			dfs(to);
			vis[now]=0;
			s[++cnt]=e[next.cnt];
		}
	}
}
bool cmp(edge x,edge y){
	if(a1[x.r]==a1[y.r]){
		return x.val<y.val;
	}
	return a1[x.r]>a1[y.r];
}
long long fa[10000001];
long long find(long long x){
	if(fa[x]==x){
		return x;
	}
	return fa[x]=find(fa[x]);
}
void join(long long x,long long y){
	x=find(x),y=find(y);
	fa[x]=fa[y];
}
bool vis1[1000001];
long long ku(){
	long long ans=0,ans1=0;
	for(long long i=1;i<=cnt;i++){
		long long a=find(s[i].l);
		long long b=find(s[i].r);
		if(a!=b){
		//	cout<<s[i].l<<" "<<s[i].r<<endl;
			ans+=s[i].val;
			ans1+=(1^vis1[a])+(1^vis1[b]);
			vis1[a]=vis1[b]=1;
			join(a,b);
		}
	}
	cout<<ans1<<" "<<ans;
	return 0ll;
}
signed main(){
	cin>>n>>m;
	for(long long i=1;i<=n;i++){
		fa[i]=i;
		cin>>a1[i];
	}
	int cnt=0;
	for(long long i=1;i<=m;i++){
		long long l,r,val;
		cin>>l>>r>>val;
		if(a1[l]>=a1[r]){
			e[++cnt]={l,r,val};
			a[l].push_back({cnt,r});
		}
		if(a1[r]>=a1[l]){
			e[++cnt]={r,l,val};
			a[r].push_back({cnt,l});
		}
	}
	cnt=0;
	dfs(1);
	sort(s+1,s+1+cnt,cmp);
	ku();
}