import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] stays = new int[n]; for (int i = 0; i < n; i++) { stays[i] = sc.nextInt(); } int m = sc.nextInt(); int[][] costs = new int[n][n]; for (int i = 0; i < n; i++) { Arrays.fill(costs[i], Integer.MAX_VALUE / 2); costs[i][i] = 0; } for (int i = 0; i < m; i++) { int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); costs[a][b] = c; costs[b][a] = c; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { for (int l = 0; l < n; l++) { costs[j][l] = Math.min(costs[j][l], costs[j][k] + costs[k][l]); } } } } long min = Long.MAX_VALUE; for (int i = 1; i < n - 2; i++) { for (int j = i + 1; j < n - 1; j++) { min = Math.min(min, 0L + stays[i] + stays[j] + costs[0][i] + costs[i][j] + costs[n - 1][j]); min = Math.min(min, 0L + stays[i] + stays[j] + costs[0][j] + costs[i][j] + costs[n - 1][i]); } } System.out.println(min); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }