#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
ll d[50][50];
int n, m;
void init() {
	rep(i, n) {
		rep(j, n) {
			if (i == j)d[i][j] = 0;
			else d[i][j] = mod;
		}
	}
}
ll s[50];
int main(){
	cin >> n; init();
	rep(i, n) {
		cin >> s[i];
	}
	cin >> m;
	rep(i, m) {
		int a, b;ll c; cin >> a >> b >> c;
		d[a][b] = d[b][a] = min(d[a][b], c);
	}
	rep(k, n) {
		rep(i, n) {
			rep(j, n) {
				d[i][j] = min(d[i][k] + d[k][j], d[i][j]);
			}
		}
	}
	ll out = INF;
	rep1(i, n - 2) {
		rep1(j, n - 2){
			if (i == j)continue;
			out = min(out, d[0][i] + d[i][j] + d[j][n - 1]+s[i]+s[j]);
		}
	}
	cout << out << endl;
	return 0;
}