#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using edge = struct
{
    int to;
    int cost;
};

int N, M;
vector<int> s;
int d[51][51];

int main()
{
    cin >> N;
    s.resize(N);
    rep(i, N) cin >> s[i];

    rep(i, N) rep(j, N) if (i != j) d[i][j] = iINF;

    cin >> M;

    rep(i, M)
    {
        int a, b, c;
        cin >> a >> b >> c;
        d[a][b] = c;
        d[b][a] = c;
    }

    ll ans = iINF;

    rep(k, N) rep(i, N) rep(j, N)
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);

    for(int i = 1; i < N - 1; i++)
    {
        for(int j = 1; j < N - 1; j++)
        {
            if(i != j)
                ans = min(ans, (ll)s[i] + s[j] + d[0][i] + d[i][j] + d[j][N - 1]);
        }
    }
    cout << ans << endl;
}