#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int (i) = 0; i < (n); i++)

int d[50][50];
int s[50];

using namespace std;
void init_d(int n) {
	rep(i, n)rep(j, n)rep(k, n) {
		if (i != j && j != k && k != i) {
			d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
		}
	}
}
int main() {
    rep(i, 50)rep(j, 50) { d[i][j] = d[j][i] = 999999; }
	int N,M,ans = 999999;
	cin >> N; rep(i,N) { cin >> s[i]; }
	cin >> M; rep(i, M) { int a, b, c; cin >> a >> b >> c; d[a][b] = d[b][a] = c; }
	init_d(N);
	for (int i = 1; i < N - 1;i++) {
		for (int j = 1; j < N - 1;j++) {
			if (i != j) {
				int temp = d[0][i] + d[i][j] + d[j][N - 1] + s[i] + s[j];
				ans = min(temp, ans);
			}
		}
	}	
	cout << ans << endl;
	return 0;
}