#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(cin >> N) {
		vi S(N);
		rep(i, N) cin >> S[i];
		vector<vi> g(N, vi(N, INF));
		rep(i, N) g[i][i] = 0;
		int M;
		cin >> M;
		rep(i, M) {
			int A, B, C;
			cin >> A >> B >> C;
			amin(g[A][B], C);
			amin(g[B][A], C);
		}
		rep(k, N) rep(i, N) rep(j, N)
			amin(g[i][j], g[i][k] + g[k][j]);
		int ans = INF;
		reu(a, 1, N-1) reu(b, 1, N-1) if(a != b)
			amin(ans, (int)min((ll)INF, (ll)g[0][a] + S[a] + g[a][b] + S[b] + g[b][N-1]));
		printf("%d\n", ans);
	}
	return 0;
}