#include <bits/stdc++.h>
using namespace std;

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug( fmt, ... ) \
        fprintf( stderr, \
                  fmt "\n", \
                  ##__VA_ARGS__ \
        )

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1 << 29;
const double EPS = 1e-10;

double zero(double d) {
    return d < EPS ? 0.0 : d;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

struct prepare {
	prepare() {
	    cout.setf(ios::fixed, ios::floatfield);
	    cout.precision(8);
	    ios_base::sync_with_stdio(false);
	}
} _prepare;

struct Edge {
    int to, cost;
};
// (cost, (pos, (stay1, stay2)))
typedef pair<int, pair<int, pii> > info;

int main() {
    int N; cin >> N;
    vi S(N);
    rep(i, N) {
        cin >> S[i];
        if(S[i] == 0)
            S[i] = INF;
    }

    int M; cin >> M;
    vector< vector<Edge> > edges(N);
    rep(i, M) {
        int a, b, c;
        cin >> a >> b >> c;
        edges[a].push_back(Edge{b, c});
        edges[b].push_back(Edge{a, c});
    }

    // dp[i][j][k] := 地点i、滞在がj, kの最小コスト
    vector<vvi> dp(N, vvi(N, vi(N, INF) ));
    dp[0][0][0] = 0;

    priority_queue<info, vector<info>, greater<info> > que;
    que.push(mp(0, mp(0, mp(0, 0))));
    while(!que.empty()) {

        int cost = que.top().first;
        int pos = que.top().second.first;
        int stay1 = que.top().second.second.first;
        int stay2 = que.top().second.second.second;
        que.pop();

        if(stay1 != 0 && stay1 == stay2)
            continue;

        if(pos == N-1 && stay2 != 0) {
            cout << cost << endl;
            return 0;
        }

        chmin( dp[pos][stay1][stay2], cost );

        tr(it, edges[pos]) {
            if(dp[it->to][stay1][stay2] == INF) {
                que.push(mp(cost + it->cost, mp(it->to, mp(stay1, stay2))));
            }
            if(stay1 == 0 && dp[it->to][it->to][0] == INF) {
                que.push(mp(cost + it->cost + S[it->to], mp(it->to, mp(it->to, 0))));
            }
            if(stay1 != 0 && stay2 == 0 && dp[it->to][stay1][it->to] == INF) {
                que.push(mp(cost + it->cost + S[it->to], mp(it->to, mp(stay1, it->to))));
            }
        }
    }
    
    return 0;
}