# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

const int MAX_V = 55;
LL d[MAX_V][MAX_V];//d[i][j]はe={u,v}のコスト

int n, m;
int s[55];
int a, b, c;

void warshall_floyd(){
	for(int k=0;k<n;k++){
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
			}
		}
	}
}

int main(){
    cin >> n;
    REP(i, n)cin >> s[i];
    REP(i, 55)REP(j, 55){
        if(i == j)continue;
        d[i][j] = d[j][i] = HINF<LL>();
    }
    cin >> m;
    REP(i, m){
        cin >> a >> b >> c;
        d[a][b] = d[b][a] = c;
    }
    warshall_floyd();
    LL ans = INF<LL>();
    for(int i = 1;i < n - 1;i++)for(int j = 1;j < n - 1;j++){
        if(i == j)continue;
        if(d[0][i] == HINF<LL>())continue;
        if(d[i][j] == HINF<LL>())continue;
        if(d[j][n - 1] == HINF<LL>())continue;
        ans = min(ans, d[0][i] + s[i] + d[i][j] + s[j] + d[j][n - 1]);
    }
    cout << ans << endl;
}