#include <algorithm>
#include <iostream>

using namespace std;

const int INF = 1000000000;

int N;
int S[50];
int M;
int A[25 * 49], B[25 * 49], C[25 * 49];
int d[50][50];

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> S[i];
	}
	cin >> M;
	for (int i = 0; i < M; i++) {
		cin >> A[i] >> B[i] >> C[i];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			d[i][j] = INF;
		}
	}
	for (int i = 0; i < M; i++) {
		d[A[i]][B[i]] = min(d[A[i]][B[i]], C[i]);
		d[B[i]][A[i]] = min(d[B[i]][A[i]], C[i]);
	}
	for (int k = 0; k < N; k++) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	int res = INF;
	for (int i = 1; i < N - 1; i++) {
		for (int j = 1; j < N - 1; j++) {
			if (i == j) {
				continue;
			}
			res = min(res, d[0][i] + S[i] + d[i][j] + S[j] + d[j][N - 1]);
		}
	}
	cout << res << endl;
	return 0;
}