#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	int N;
	cin>>N;
	int S[50];
	rep(i,N){
		cin>>S[i];
	}
	int M;
	cin>>M;
	int C[50][50];
	int mP[50][50];
	rep(i,N)rep(k,N){
		C[i][k] = -1;
		if(i!=k){
			mP[i][k] = 10000;
		}
		else{
			mP[i][k] = 0;
		}
	}
	int a,b,c;
	rep(i,M){
		cin>>a>>b>>c;
		if( C[a][b] == -1){
			C[a][b] = c;
			C[b][a] = c;
			mP[a][b] = c;
			mP[b][a] = c;
		}else{
			C[a][b] = min(C[a][b],c);
			C[b][a] = C[a][b];
			mP[a][b] = C[a][b];
			mP[b][a] = C[a][b];
		}
	}
	///////////
	
	for(int i=0; i<N;++i){
		for(int j=0; j<N; ++j){
			for(int k=0; k<N; k++){
				mP[j][k] = min( mP[j][k], mP[j][i]+mP[i][k]);
			}
		}
	}
	/////////
	int ans = -1;
	int tans;
	for(int i=1;i<N-1;++i){
		for(int k=1;k<N-1;++k){
			if(i!=k){
				tans = mP[0][i]+mP[i][k]+mP[k][N-1]+S[i]+S[k];
				if( ans == -1 || ans > tans){
					ans = tans;
				}
			}
		}
	}
	P(ans);
	return 0;
}