#include<iostream>
#include<algorithm>
using namespace std;
#define inf		10000000

int main()
{
	int n, *s, m, i, a, b, c, k, j, ans = inf;
	cin >> n;
	s = new int[n];
	int **d = new int*[n];
	for (i = 0; i < n; i++) {
		d[i] = new int[n];
		for (j = 0; j < n; j++) {
			d[i][j] = inf;
		}
	}

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

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

	for (k = 0; k < n; k++) {
		for (j = 0; j < n; j++) {
			for (i = 0; i < n; i++) {
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	for (i = 1; i < n - 1; i++) {
		for (j = 1; j < n - 1; j++) {
			if (i != j) {
				ans = min(ans, d[0][i] + d[i][j] + d[j][n - 1] + s[i] + s[j]);
			}
		}
	}
	cout << ans << endl;
	for (i = 0; i < n; i++) {
		delete[] d[i];
	}
	delete[] d;
	delete[] s;
	return 0;
}