#include <iostream>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i=0;i<n;++i)
#define rep(i,a,b) for(int i=a;i<b;++i)
using namespace std;
const int INF = 1 << 23;
int main(){
	int n;	cin >> n;
	vector<int> s(n);
	REP(i,n) cin >> s[i];
	int m;	cin >> m;
	vector<vector<int>> move(n, vector<int>(n,INF));

	REP(i,m){
		int a, b, c;
		cin >> a >> b >> c;
		move[a][b] = move[b][a] = c;
	}

	REP(k, n) REP(i, n) REP(j, n){
		move[i][j] = min(move[i][j], move[i][k] + move[k][j]);
	}

	int cost = INF;
	rep(i, 1, n - 1) rep(j, 1, n - 1) if (i != j){
		cost = min(cost, move[0][i] + s[i] + move[i][j] + s[j] + move[j][n - 1]);
	}
	cout << cost << endl;
	return 0;
}