import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

class Main{

static final int INF=Integer.MAX_VALUE/2;
static final PrintWriter out=new PrintWriter(System.out);

static class Node{
int d;
int v;
Node(int d,int v){
this.d=d; this.v=v;
}
static final Comparator<Node> DISTANCE_ORDER=new DistanceOrderComparator();
public static class DistanceOrderComparator implements Comparator<Node>{
public int compare(Node n1,Node n2){
return (n1.d>n2.d)?1:(n1.d<n2.d)?-1:0;
}
}
}

static class Edge{
int to;
int cost;
Edge(int to,int cost){
this.to=to; this.cost=cost;
}
}

static class MyArrayList extends ArrayList<Edge>{}

public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String line="";
while((line=br.readLine())!=null&&!line.isEmpty()){
int n=Integer.parseInt(line);
MyArrayList[] array=new MyArrayList[n];
int[] s=new int[n];
int[][] d=new int[n][n];
for(int i=0;i<n;i++) s[i]=Integer.parseInt(br.readLine());
int m=Integer.parseInt(br.readLine());
for(int i=0;i<n;i++) array[i]=new MyArrayList();
for(int i=0;i<m;i++){
line=br.readLine();
StringTokenizer st=new StringTokenizer(line);
int a=Integer.parseInt(st.nextToken());
int b=Integer.parseInt(st.nextToken());
int c=Integer.parseInt(st.nextToken());
array[a].add(new Edge(b,c));
array[b].add(new Edge(a,c));
}
for(int i=0;i<n;i++) dijkstra(i,d,array);
long ans=Long.MAX_VALUE;
for(int i=1;i<n-1;i++){
if(d[0][i]==INF) continue;
for(int j=1;j<n-1;j++){
if(i==j||d[i][j]==INF||d[j][n-1]==INF) continue;
ans=Math.min(ans,d[0][i]+s[i]+d[i][j]+s[j]+d[j][n-1]);
}
}
out.println(ans);
out.flush();
}
}
private static void dijkstra(int s,int[][] d,MyArrayList[] array){
PriorityQueue<Node> pque=new PriorityQueue<Node>(1,Node.DISTANCE_ORDER);
Arrays.fill(d[s],INF);
d[s][s]=0;
pque.offer(new Node(0,s));
while(!pque.isEmpty()){
Node n=pque.poll();
int v=n.v;
ArrayList<Edge> list=array[v];
if(d[s][v]<n.d||list.size()==0) continue;
for(int i=0;i<list.size();i++){
Edge e=list.get(i);
int to=e.to;
int dv=d[s][v];
int cost=e.cost;
if(d[s][to]>dv+cost){
d[s][to]=dv+cost;
pque.offer(new Node(d[s][to],to));
}
}
}
}
}