#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>

using namespace std;

int N, M, S[55], A, B, C, dp[55][55];

int main() {

	cin >> N;
	for (int i = 0; i < N; i++) cin >> S[i];

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			dp[i][j] = 1000000;
		}
		dp[i][i] = 0;
	}

	cin >> M;
	for (int i = 0; i < M; i++) {
		cin >> A >> B >> C;
		dp[A][B] = min(dp[A][B], C);
		dp[B][A] = dp[A][B];
	}
	
	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]);
			}
		}
	}
	/*
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << dp[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/
	int ans = (int)1e9;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (i == j || i == 0 || i == N-1 || j == 0 || j == N - 1) continue;
			//cout << "i: " <<i << " j: " << j <<" ans: " << ans<< endl;
			if (ans < 0) return 0;
			ans = min(ans, dp[i][j] + S[i] + S[j] + min(dp[0][i] + dp[N - 1][j], dp[0][j] + dp[N - 1][i]));
		}
	}

	cout << ans << endl;

	return 0;
}