#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int D[55][55];
const int inf = 1<<29;
int main()
{
    int N;
    cin>>N;
    VI S(N);
    FOR(i,N) cin>>S[i];
    int M;
    cin>>M;
    FOR(i,N) FOR(j,N) D[i][j] = inf;
    FOR(i,N) D[i][i] = 0 ;
    FOR(i,M){
        int A,B,C;
        cin>>A>>B>>C;
        D[A][B] = min(D[A][B], C);
        D[B][A] = min(D[B][A], C);
    }
    FOR(i,N) FOR(j,N) FOR(k,N) D[j][k] = min(D[j][k], D[j][i] + D[i][k]);
    int ans = inf;
    for(int i=1;i<N-1;i++){
        for(int j=1;j<N-1;j++) if(i != j){
            int cost = D[0][i] + D[i][j] + D[j][N-1] + S[i] + S[j];
            if(ans > cost) ans = cost;
        }
    }
    cout<<ans<<endl;
    return 0;
}