#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
inline int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){ if(ch=='-') f=-1;ch=getchar(); }
	while(ch>='0'&&ch<='9'){ x=(x<<1)+(x<<3)+ch-'0'; ch=getchar(); }
	return x*f;
}
const int Maxn=1e3+5;//suppose the n is already bought
int n;
int f[Maxn][Maxn],num[Maxn][Maxn];
int main()
{
	n=read();
	memset(f,0x3f,sizeof(f));
	for(int i=0;i<=n;i++) 
	{
		f[i][i]=0;
	}
	for(int i=0;i<=n-1;i++)
	{
		f[n][i]=read();
		num[n][i]=1;
	}
	int a,b,c;
	while(scanf("%d%d%d",&a,&b,&c)==3)
	{
		f[a][c]=f[n][b];
		f[b][c]=f[n][a];
		num[a][c]=1;num[b][c]=1;
	}
	for(int k=0;k<=n;k++)
	{
		for(int i=0;i<=n;i++)
		{
			for(int j=0;j<=n;j++)
			{
				if(f[i][j]>f[i][k]+f[k][j])
				{
					f[i][j]=f[i][k]+f[k][j];
					num[i][j]=num[i][k]*num[k][j];
				}
				else if(f[i][j]==f[i][k]+f[k][j])
				{
					num[i][j]+=num[i][k]*num[k][j];
				}
			}
		}
	}
	printf("%d %d",f[n][0],num[n][0]);
	
	
	
	
	return 0;
}