#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
using namespace std;
typedef long long ll;
 
const int INF = 1 << 25;
 
int N, M;
int S[60];
 
int D[60][60];
 
int main(){
    for(int i=0;i<60;i++)for(int j=0;j<60;j++)D[i][j] = INF;
    for(int i=0;i<60;i++)D[i][i] = 0;
 
    cin >> N;
    for(int i=0;i<N;i++)cin >> S[i];
 
    cin >> M;
    for(int i=0;i<M;i++){
        int s, t, c;
        cin >> s >> t >> c;
 
        D[s][t] = c;
        D[t][s] = c;
    }
 
    for(int k=0;k<N;k++)for(int i=0;i<N;i++)for(int j=0;j<N;j++){
        D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
    }
 
    int res = INF;
    for(int i=1;i<N-1;i++)for(int j=1;j<N-1;j++)if(i != j){
        res = min(res, S[i] + S[j] + D[0][i] + D[i][j] + D[j][N-1]);
        res = min(res, S[i] + S[j] + D[0][j] + D[j][i] + D[i][N-1]);
    }
 
    cout << res << endl;
 
    return 0;
}