#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[]={0,1,0,-1,0,2,0,-2};
int dy[]={1,0,-1,0,2,0,-2,0};
int main(){
	int n;
	cin>>n;
	vi s(n);
	rep(i,n)cin>>s[i];
	int m;
	cin>>m;
	vvi cost(n,vi(n,inf));
	while(m--){
		int a,b,c;
		cin>>a>>b>>c;
		cost[a][b]=cost[b][a]=c;
	}
	rep(k,n)rep(i,n)rep(j,n)cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
	int out=inf;
	loop(i,1,n-1)loop(j,1,n-1)if(i!=j)out=min(out,s[i]+s[j]+cost[0][i]+cost[i][j]+cost[j][n-1]);
	cout<<out<<endl;
}