#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const int MAX = 100*52;
struct edge {
    int to, cost;
};

vector<edge> G[MAX];
int d[MAX];

void dijkstra(int s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d, d+MAX, inf);
    d[s] = 0;
    que.push(P(0, s));
    while (!que.empty()) {
	P p = que.top(); que.pop();
	int v = p.second;
	if (d[v] < p.first) continue;
	for (int i = 0; i < G[v].size(); i++) {
	    edge e = G[v][i];
	    if (d[e.to] > d[v] + e.cost) {
		d[e.to] = d[v] + e.cost;
		que.push(P(d[e.to], e.to));
	    }
	}
    }
}

int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
	int s;
	scanf("%d", &s);
	if (0 < i && i < n-1) {
	    G[i].push_back(edge{i+(2*i-1)*n, s});
	    for (int j = 1; j < n-1; j++) {
		if (j != i) {
		    G[i+(2*j-1)*n].push_back(edge{i+2*j*n, s});
		}
	    }
	}
    }
    int m;
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
	int a, b, c;
	scanf("%d%d%d", &a, &b, &c);
	for (int j = 0; j <= 2*(n-1); j++) {
	    G[a+j*n].push_back(edge{b+j*n, c});
	    G[b+j*n].push_back(edge{a+j*n, c});
	}
    }
    dijkstra(0);

    int res = inf;
    for (int i = 1; i < n-1; i++) {
	res = min(res, d[n-1+2*i*n]);
    }
    printf("%d\n", res);
}