#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

#define N 50

int n, m;
int s[N];
unsigned int rc[N][N];

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

int main()
{
	memset(rc, 0x7F, sizeof(rc));

	cin >> n;
	for ( int i = 0; i < n; i++ ) {
		cin >> s[i];
		rc[i][i] = 0;
	}

	cin >> m;
	for ( int i = 0; i < m; i++ ) {
		int s, t, c;
		cin >> s >> t >> c;
		rc[s][t] = rc[t][s] = c;
	}

	wf();

	unsigned int mn = -1;
	for ( int i = 1; i < n-1; i++ ) {
		for ( int j = i + 1; j < n-1; j++ ) {
			mn = min(s[i] + s[j] + rc[0][i] + rc[i][j] + rc[j][n-1], mn);
			mn = min(s[i] + s[j] + rc[0][j] + rc[i][j] + rc[i][n-1], mn);
		}
	}

	cout << mn << endl;

	return 0;
}