#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

const int INF = 1e7;

int main() {
	int n, m;

	cin >> n;
	vector<int> s(n);
	for (int i = 0; i < n; i++) {
		cin >> s[i];
	}
	cin >> m;
	vector< vector<int> > dp(n, vector<int>(n, INF));

	int a, b, c;
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> c;
		dp[a][b] = c;
		dp[b][a] = c;
	}

	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
			}
		}
	}

	int ans = INF;
	for (int i = 1; i < n - 1; i++) {
		int tmp = dp[0][i] + s[i];
		for (int j = 1; j < n - 1; j++) {
			if (i == j) {
				continue;
			}
			ans = min(ans, tmp + dp[i][j] + s[j] + dp[j][n - 1]);
		}
	}

	cout << ans << endl;
	return 0;
}