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

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
typedef long long ll;

using namespace std;

int inputValue(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << fixed << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// end of template

int main() {
    // source code
    int N = inputValue(); // 50
    vector<int> S(N); // 滞在コスト, 1000
    rep(i, N){
        S[i] = inputValue();
    }
    int M = inputValue();
    vector<vector<ll>> edge(N, vector<ll>(N, inf)); // 移動コスト
    
    rep(i, N){
        edge[i][i] = 0;
    }
    rep(i, M){
        int a, b, c;
        a = inputValue();
        b = inputValue();
        c = inputValue();
        edge[a][b] = c;
        edge[b][a] = c;
    }
    
    rep(k, N){
        rep(i, N){
            rep(j, N){
                edge[i][j] = min(edge[i][j], edge[i][k] + edge[k][j]);
            }
        }
    }
    
    ll ret = inf;
    repd(i, 1, N - 1){
        repd(j, 1, N - 1){
            if (i != j) {
                ret = min(ret, edge[0][i] + edge[i][j] + edge[j][N - 1] + S[i] + S[j]);
            }
        }
    }
    
    output(ret, 0);
    
    
    return 0;
}