#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n,m;
vector<int> s;
vector<vector<pair<int,int>>> G;
int dist[50][50];
const int INF = INT_MAX/4;

void solve(){
	for(int k = 0;k<50;k++){
		for(int i = 0;i<50;i++){
			for(int j = 0;j<50;j++){
				dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
			}
		}
	}
	int ans = INF;
	for(int i = 1;i<n-1;i++){
		for(int j = 1;j<n-1;j++){
			if(i==j)continue;
			int cur = 0;
			cur += dist[0][i] + dist[i][j] + dist[j][n-1];
			cur += s[i] + s[j];
			ans = min(ans,cur);
		}
	}
	cout<<ans<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	s = vector<int>(n);
	for(auto &i:s)cin >> i;
	for(int i = 0;i<50;i++){
		for(int j = 0;j<50;j++){
			if(i!=j)
			dist[i][j] = INF;
		}
	}
	cin >> m;
	for(int i = 0;i<m;i++){
		int a,b,c;
		cin >> a >> b >> c;
		dist[a][b] = min(dist[a][b],c);
		dist[b][a] = min(dist[b][a],c);
	}
	solve();
}