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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,i; cin>>N;
    vector<ll> cost(N);
    for(i=0;i<N;++i) cin>>cost[i];
    const ll INF = 1e15;
    vector<vector<ll>> dist(N, vector<ll>(N,INF));
    for(int i=0;i<N;++i) dist[i][i]=0;
    int M;cin>>M;
    for(i=0;i<M;++i){
        int a,b; ll c; cin>>a>>b>>c;
        dist[a][b]=min(dist[a][b], c);
        dist[b][a]=min(dist[b][a],c);
    }

    for(int k=0;k<N;++k){
        for(int i=0;i<N;++i){
            for(int j=0;j<N;++j){
                if(dist[i][k]==INF || dist[k][j]==INF) continue;
                dist[i][j]=min(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }
    // print__(dist, cost);

    ll ANS=INF;
    for(int i=1;i+1<N;++i) for(int j=1;j+1<N;++j) if(i!=j){
        ANS=min(ANS,dist[0][i]+cost[i]+dist[i][j]+cost[j]+dist[j][N-1]);
    }
    cout<<ANS<<endl;
    return 0;
}