#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n, m;
int s[50];
vector<pii> g[50];
int d[52][50];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", s + i);
	cin >> m;
	REP(i, m) {
		int a, b, c;
		scanf("%d %d %d", &a, &b, &c);
		g[a].push_back(pii(b, c));
		g[b].push_back(pii(a, c));
	}
	
	priority_queue<P, vector<P>, greater<P> > pq;
	
	fill(d[0], d[52], INF);
	
	pq.push(P(0, pii(0, 0)));
	
	while (!pq.empty()) {
		P now = pq.top(); pq.pop();
		
		int cost = now.first;
		int done = now.second.first;
		int pos = now.second.second;
		
		if (!chmin(d[done][pos], cost)) continue;
		
		if (pos != 0 && pos != n - 1 && done != n + 1) {
			if (done == 0) pq.push(P(cost + s[pos], pii(pos + 1, pos)));
			else if (pos + 1 != done) pq.push(P(cost + s[pos], pii(n + 1, pos)));
		}
		
		REP(i, g[pos].size()) {
			int np = g[pos][i].first;
			int nc = cost + g[pos][i].second;
			
			if (d[done][np] <= nc) continue;
			pq.push(P(nc, pii(done, np)));
		}
	}
	
	cout << d[n + 1][n - 1] << endl;
	
	return 0;
}