#include <queue>
#include <algorithm>
#include <vector>
#include <set>
#include <iostream>
#include <numeric>
#include <tuple>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef tuple<int,int,int> tiii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define ALL(container) (container).begin(), (container).end()



struct edge{
    edge(int to_,int cost_) : to(to_), cost(cost_)
    {
    }
    int to;
    int cost;
};

int N;
int s[51];
int M;

vector<edge> g[51];

static const int INF = 10000000;


int main(){
    cin >> N;
    REP(i, N)
    {
        cin >> s[i];
    }
    cin >> M;
    REP(i, M)
    {
        int a,b,c;
        cin >> a >> b >> c;
        g[a].emplace_back(b,c);
        g[b].emplace_back(a,c);
    }
    
    int minCost = INF;
    
    REP(i, g[0].size())
    {
        auto& next = g[0][i];
        if(next.to == N-1)
        {
            continue;
        }
        REP(j, g[next.to].size())
        {
            auto & nn = g[next.to][j];
            if(nn.to == 0)
            {
                continue;
            }
            REP(k, g[nn.to].size())
            {
                auto & nnn = g[nn.to][k];
                if(nnn.to != N-1)
                {
                    continue;
                }
                auto sum = next.cost + s[next.to]
                 + nn.cost + s[nn.to]
                + nnn.cost + s[nnn.to];
                minCost=min(minCost, sum);
            }
        }
    }
    cout << minCost << endl;
    return 0;
}