#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N, S[50], INF = INT_MAX / 10;
int dis[50][50];

int main(){
    cin >> N;
    rep(i, N)rep(j, N)dis[i][j] = INF;
    rep(i, N)cin >> S[i], dis[i][i] = 0;
    int M; cin >> M;
    while(M--) {
        int A, B, C;
        scanf("%d%d%d", &A, &B, &C);
        dis[A][B] = dis[B][A] = C;
    }
    rep(k, N)rep(u, N)rep(v, N)smin(dis[u][v], dis[u][k] + dis[k][v]);
    int ans = INF;
    FOR(i, 1, N - 1)FOR(j, 1, N - 1)if(i != j) {
        smin(ans, dis[0][i] + dis[i][j] + dis[j][N - 1] + S[i] + S[j]);
    }
    cout << ans << endl;
}