#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl

using namespace std;

typedef long long int lli;

template<typename T>
vector<T> make_v(size_t a, T b) {
    return vector<T>(a, b);
}

template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

int main() {
    int N;
    cin >> N;
    vector<lli> S(N);
    REP(i, 0, N) {
        cin >> S[i];
    }
    int M;
    cin >> M;
    const lli inf = 1LL << 50;
    auto Cost = make_v(N, N, inf);
    REP(i, 0, M) {
        lli A, B, C;
        cin >> A >> B >> C;
        Cost[A][B] = min(Cost[A][B], C);
        Cost[B][A] = min(Cost[B][A], C);
    }
    REP(k, 0, N) {
        REP(i, 0, N) {
            REP(j, 0, N) {
                Cost[i][j] = min(Cost[i][j], Cost[i][k] + Cost[k][j]);
            }
        }
    }
    lli ans = inf;
    REP(i, 1, N - 1) {
        REP(j, 1, N - 1) {
            if (i == j) continue;
            ans = min(ans, S[i] + S[j] + Cost[0][i] + Cost[i][j] + Cost[j][N - 1]);
        }
    }
    cout << ans << endl;
    return 0;
}