#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 10010;
int n, a[N], l, u, c, f[N][N];
int k[N], ans[N];
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 << 3) + (x << 1) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
inline void write(int x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i], ans[i] = 1;
	while (scanf("%lld%lld%lld", &l, &u, &c) != EOF) f[l + 1][u + 1] = f[u + 1][l + 1] = c + 1;
	for (int i = 1; i < n; i++) {
		int maxn = LLONG_MAX;
		int b = -1;
		for (int j = 1; j <= n; j++) {
			if (!k[j] && a[j] < maxn) {
				maxn = a[j];
				b = j;
			}
		}
		if (b == -1) break;
		k[b] = 1;
		for (int j = 1; j <= n; j++) {
			if (k[j] && f[b][j]) {
				if (a[j] + a[b] == a[f[b][j]]) ans[f[b][j]] += ans[b] * ans[j];
				if (a[j] + a[b] < a[f[b][j]]) {
					a[f[b][j]] = a[b] + a[j];
					ans[f[b][j]] = ans[b] * ans[j];
				}
			}
		}
	}
	cout << a[1] << " " << ans[1] << "\n";
	return 0;
}