#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#define INF 99999999;
using namespace std;

int main(int argc, const char * argv[]) {
    int N;
    int tmp;
    cin >> N;
    vector<int> S;
    for (int i = 0; i < N; i++) {
        cin >> tmp;
        S.push_back(tmp);
    }
    int M;
    cin >> M;
    vector<int> movedir1;
    vector<int> movedir2;
    vector<int> movecost;
    for (int i = 0; i < M; i++) {
        cin >> tmp;
        movedir1.push_back(tmp);
        cin >> tmp;
        movedir2.push_back(tmp);
        cin >> tmp;
        movecost.push_back(tmp);
    }
    //ワーシャルフロイド
    //距離の初期化
    int dist[N][N];
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            dist[i][j] = INF;
        }
        dist[i][i] = 0;
    }
    //取得した距離をdistにいれる
    for (int i = 0; i < movedir1.size(); i++) {
        dist[movedir1[i]][movedir2[i]] = movecost[i];
        dist[movedir2[i]][movedir1[i]] = movecost[i];
    }
    //三重ループで各距離を求める
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < N; k++) {
                dist[j][k] = min(dist[j][k],dist[j][i]+dist[i][k]);
            }
        }
    }
    int result = INF;
    //二重ループで泊まる地点を求める
    for (int i = 1; i < N-1; i++) {
        for (int j = 1; j < N-1; j++) {
            if (i == j) {
                continue;
            }
            result = min(result,dist[0][i]+dist[i][j]+dist[j][N-1]+S[i]+S[j]);
        }
    }
    cout << result << endl;
}