#include <iostream>
#include <vector>
#include <queue>
using namespace std;

const int INF = 1 << 25;

int n;
int s[50];
vector<pair<int,int>> g[50];

int d[16384];
inline int packer(int now, int cnt, int pre){
	if(cnt != 1)pre = 0;
	return (((pre<<2)|cnt)<<6)|now;
}

int dijkstra(){
	fill(begin(d), end(d), INF);
	d[0] = 0;

	priority_queue<int, vector<int>, greater<int>> pq;
	pq.push(0);

	while(!pq.empty()){
		int pack = pq.top(); pq.pop();
		int now = pack & 63; pack >>= 6;
		int cnt = pack & 3;  pack >>= 2;
		int pre = pack & 63; pack >>= 6;
		int cost = pack;

		if(now == n - 1 && cnt == 2){
			return cost;
		}

		for(auto ps : g[now]){
			int nxt = ps.first;
			int nxt_cost = cost + ps.second;
			
			int p = packer(nxt, cnt, pre);
			if(nxt_cost < d[p]){
				d[p] = nxt_cost;
				pq.push((nxt_cost<<14)|p);
			}

			if(nxt == 0 || nxt == n - 1){
				continue;
			}
			if(cnt == 0 || (cnt == 1 && nxt != pre)){
				int p = packer(nxt, cnt + 1, nxt);
				int nc = nxt_cost + s[nxt];
				if(nc < d[p]){
					d[p] = nc;
					pq.push((nc<<14)|p);
				}
			}
		}
	}
	return INF;
}

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

	int m;
	cin >> m;
	for(int i=0;i<m;i++){
		int a, b, c;
		cin >> a >> b >> c;

		g[a].emplace_back(b, c);
		g[b].emplace_back(a, c);
	}

	cout << dijkstra() << endl;
	return 0;
}