#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define INF (100000007)

int N;
int S[50];
int M;
int es[50][50];

int main(int argc, char **argv) {
	cin >> N;
	REP(i, N) cin >> S[i];
	REP(i, N) REP(j, N) es[i][j] = (i == j ? 0 : INF);
	cin >> M;
	REP(i, M) {
		int a, b, c;
		cin >> a >> b >> c;
		es[a][b] = es[b][a] = c;
	}
	REP(k, N) REP(i, N) REP(j, N) es[i][j] = min(es[i][j], es[i][k] + es[k][j]);
	int res = INF;
	FOR(i, 1, N - 1) FOR(j, 1, N - 1) {
		if (i == j || es[0][i] >= INF || es[i][j] >= INF || es[j][N - 1] >= INF) continue;
		res = min(res, es[0][i] + S[i] + es[i][j] + S[j] + es[j][N - 1]);
	}
	cout << res << endl;
	return 0;
}