package no017;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] s = new int[n];
		for(int i=0;i<n;i++) {
			s[i] = sc.nextInt();
		}
		int m = sc.nextInt();
		int[][] dist = new int[n][n];
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				if (i != j) {
					dist[i][j] = 1 << 29;
				}
			}
		}
		for(int i=0;i<m;i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = sc.nextInt();
			dist[a][b] = dist[b][a] = c;
		}
		for(int k=0;k<n;k++) {
			for(int i=0;i<n;i++) {
				for(int j=0;j<n;j++) {
					dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
				}
			}
		}
		int ans = 1 << 29;
		for(int i=1;i<n-1;i++) {
			for(int j=1;j<n-1;j++) {
				if (i == j) {
					continue;
				}
				ans = Math.min(ans, dist[0][i]+dist[i][j]+dist[j][n-1]+s[i]+s[j]);;
			}
		}
		System.out.println(ans);
	}

}