#include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2") #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--) #define all(x) (x).begin(), (x).end() #define sz(x) int(x.size()) #define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n" #define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n" using namespace std; using ll = long long; using vi = vector<int>; using vl = vector<ll>; using vs = vector<string>; using vc = vector<char>; using vd = vector<double>; using vld = vector<long double>; using vvi = vector<vector<int>>; using vvl = vector<vector<ll>>; using vvs = vector<vector<string>>; using vvc = vector<vector<char>>; using vvd = vector<vector<double>>; using vvld = vector<vector<long double>>; using vvvi = vector<vector<vector<int>>>; using vvvl = vector<vector<vector<ll>>>; using vvvvi = vector<vector<vector<vector<int>>>>; using vvvvl = vector<vector<vector<vector<ll>>>>; using pii = pair<int,int>; using pll = pair<ll,ll>; const int INF = 1e9; const ll LINF = 2e18; template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } bool ispow2(int i) { return i && (i & -i) == i; } bool ispow2(ll i) { return i && (i & -i) == i; } template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); } template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); } template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (int i = 0; i < int(v.size()); i++) { is >> v[i]; } return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < int(v.size()); i++) { os << v[i]; if (i < int(v.size()) - 1) os << ' '; } return os; } static uint32_t RandXor(){ static uint32_t x=123456789; static uint32_t y=362436069; static uint32_t z=521288629; static uint32_t w=88675123; uint32_t t; t=x^(x<<11); x=y; y=z; z=w; return w=(w^(w>>19))^(t^(t>>8)); } static double Rand01(){ return (RandXor()+0.5)*(1.0/UINT_MAX); } template <typename Matrix, typename T> void warshall_floyd(Matrix &g, T INF){ for (size_t k = 0; k < g.size(); k++){ for (size_t i = 0; i < g.size(); i++){ for (size_t j = 0; j < g.size(); j++){ if (g[i][k] == INF || g[k][j] == INF) continue; g[i][j] = min(g[i][j], g[i][k] + g[k][j]); } } } } void solve(){ int N; cin>>N; vi S(N); cin>>S; int M; cin>>M; vvi E(N,vi(N,INF)); rep(i,N) E[i][i]=0; while(M--){ int A,B,C; cin>>A>>B>>C; E[A][B]=C; E[B][A]=C; } warshall_floyd(E,INF); int ans=INF; for(int i=1;i<N-1;i++){ if(E[0][i]==INF) continue; for(int j=1;j<N-1;j++){ if(i==j) continue; if(E[i][j]==INF || E[j][N-1]==INF) continue; chmin(ans,E[0][i]+E[i][j]+E[j][N-1]+S[i]+S[j]); } } cout<<ans<<endl; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); solve(); }