#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>

using namespace std;

int main(){

    long long N, M, a, b, c, ans=1e18;
    cin >> N;
    vector<long long> S(N);
    for (int i=0; i<N; i++) cin >> S[i];
    cin >> M;
    vector<vector<long long>> dist(N, vector<long long>(N, 1e18));

    for (int i=0; i<N; i++) dist[i][i] = 0;

    for (int i=0; i<M; i++){
        cin >> a >> b >> c;
        dist[a][b] = min(c, dist[a][b]);
        dist[b][a] = min(c, dist[b][a]);
    }

    for (int k=0; k<N; k++){
        for (int i=0; i<N; i++){
            for (int j=0; j<N; j++){
                dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }

    for (int i=1; i<N-1; i++){
        for (int j=1; j<N-1; j++){
            if (i == j) continue;
            ans = min(ans, dist[0][i] + dist[i][j] + dist[j][N-1] + S[i]+S[j]);
        }
    }

    cout << ans << endl;

    return 0;
}