#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

#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 rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
typedef long long ll;

#define NMAX 50
int N;
int S[NMAX];
int M;

int d[NMAX][NMAX];

#define CINF 1e9

int main()
{
    cin >> N;
    rep(i, N)
    {
        rep(j, N)
        {
            if (i != j) {
                d[i][j] = CINF;
            } else {
                d[i][j] = 0;
            }
        }
    }
    rep(i, N)
    {
        cin >> S[i];
    }
    cin >> M;
    rep(i, M)
    {
        int a, b, c;
        cin >> a >> b >> c;
        d[a][b] = c;
        d[b][a] = c;
    }

    rep(k, N)
    {
        rep(i, N)
        {
            rep(j, N)
            {
                if (d[i][j] > d[i][k] + d[k][j]) {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }


    int cmin = CINF;
    for (int i = 1; i < N - 1; i++) {
        for (int j = 1; j < N - 1; j++) {
            if (i != j) {
                chmin(cmin, d[0][i] + d[i][j] + d[j][N - 1] + S[i] + S[j]);
            }
        }
    }
    cout << cmin << endl;

    return 0;
}