#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)


int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    const int inf = 1e9;
    int n, m, ans, s, t, c;
    cin >> n;
    int cost[n], movecost[n][n];
    rep(i, n)
    {
        cin >> cost[i];
        fill(movecost[i], movecost[i] + n, inf);
        movecost[i][i] = 0;
    }
    cin >> m;
    rep(i, m)
    {
        cin >> s >> t >> c;
        movecost[s][t] = c;
        movecost[t][s] = c;
    }
    rep(k, n)
        rep(i, n)
            rep(j, n)
                movecost[i][j] = min(movecost[i][j], movecost[i][k] + movecost[k][j]);

    ans = inf;
    rep2(i, 1, n - 1)
        rep2(j, 1, n - 1) if (i != j)
            ans = min(ans, movecost[0][i] + movecost[i][j] + movecost[j][n - 1] + cost[i] + cost[j]);

    // rep(i, n)
    // {
    //     rep(j, n)
    //     {
    //         cout << movecost[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    cout << ans << endl;

    return 0;
}