#include <string.h>
#include <stdio.h>

#define NMAX	(50)
#define INF		(99999999)

int load[NMAX+5][NMAX+5];
int restCost[NMAX+5];

int min(int a, int b){
	if(a<b){return a;}
	return b;
}

int main(void){
	int minCost=INF;
	int i,j,k,n,m;
	
	for(i=0;i<NMAX;i++){
		for(j=0;j<NMAX;j++){
			load[i][j] = INF;
		}
	}
	
	
	scanf("%d", &n);
	for(i=0;i<n;i++){
		scanf("%d", &restCost[i]);
		load[i][i] = 0;
	}
	
	
	scanf("%d", &m);
	for(i=0;i<m;i++){
		int a,b,c;
		scanf("%d %d %d", &a, &b, &c);
		load[a][b] = c;
		load[b][a] = c;
	}
	
	
	
	for(k=0;k<n;k++){
		for(i=0;i<n;i++){
			for(j=0;j<n;j++){
				load[i][j] = min( load[i][j], load[i][k] + load[k][j]);
			}
		}
	}
	
	for(i=0;i<n;i++){
		if(i==0 || i==(n-1)){continue;}
		
		for(j=0;j<n;j++){
			int cost;
			if( i == j ){continue;}
			if(j==0 || j==(n-1)){continue;}
			
			cost = load[0][i] + load[i][j] + load[j][n-1] + (restCost[i] + restCost[j]);
			minCost = min(minCost, cost);
//			printf("i,j(%d %d) load(%d %d %d) cost(%d %d)=%d\n", i,j, load[0][i], load[i][j], load[j][n-1], restCost[i], restCost[j], cost);
		}
	}
	
	
	printf("%d\n", minCost);
	return 0;
}