#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int INF=1001001001001001001ll;

int N,M;
int S[50];
int dist[50][50];

signed main(){
    cin>>N;
    rep(i,N)cin>>S[i];
    rep(i,N)rep(j,N)dist[i][j]=INF;
    rep(i,N)dist[i][i]=0;

    cin>>M;
    rep(i,M){
        int a,b,c;cin>>a>>b>>c;
        dist[a][b]=min(dist[a][b],c);
        dist[b][a]=min(dist[b][a],c);
    }

    rep(k,N)rep(i,N)rep(j,N)
    dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);

    int ans=INF;
    reps(i,1,N-1)reps(j,1,N-1)if(i!=j){
        ans=min(ans,S[i]+S[j]+dist[0][i]+dist[i][j]+dist[j][N-1]);
    }
    cout<<ans<<endl;
    return 0;
}