#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N, M;
int INF = 1e10;

signed main()
{
    cin >> N;
    vector<int> S(N);
    REP(i,N) cin >> S[i];
    int way[N][N];
    REP(i,N) REP(j,N) {
        if (i == j) way[i][j] = 0;
        else way[i][j] = INF;
    }
    cin >> M;
    int A, B, C;
    REP(i,M) {
        cin >> A >> B >> C;
        way[A][B] = way[B][A] = C;
    }

    // ワーシャルフロイト
    REP(k, N) REP(i,N) REP(j,N) way[i][j] = min(way[i][j], way[i][k]+ way[k][j]);

    // 2点に滞在する場合のコストを全探索
    int minc = INF;
    FOR(i,1,N-1) FOR(j,1,N-1) {
        if (i == j) continue;
        int c = S[i] + S[j] + way[0][i] + way[i][j] + way[j][N-1];
        minc = min(minc, c);
    }

    cout << minc << endl;

    return 0;
}