import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {
    
    static int N, M;
    static int stayCost[];
    static int moveCost[][];
    
	public static void main(String[] args) {
		try (Scanner scan = new Scanner(System.in)) {
		    N = scan.nextInt();
		    stayCost = new int[N];
		    for(int i=0; i<N; i++) {
		        stayCost[i] = scan.nextInt();
		    }
		    M = scan.nextInt();
		    moveCost = new int[N][N];
		    for(int i=0; i<M; i++) {
		        int from = scan.nextInt();
		        int to = scan.nextInt();
		        int cost = scan.nextInt();
		        moveCost[from][to] = cost;
		        moveCost[to][from] = cost;
		    }
		    
		    int ans = Integer.MAX_VALUE;
		    for(int i=1; i<N-1; i++) {
		        for(int j=1; j<N-1; j++) {
		            if(i==j) continue;
		            
		            int v1 = calcMinCost(i, 0);
		            if(v1 == Integer.MAX_VALUE) continue;
		            
		            int v2 = calcMinCost(j, i);
		            if(v2 == Integer.MAX_VALUE) continue;
		            
		            int v3 = calcMinCost(N-1, j);
		            if(v3 == Integer.MAX_VALUE) continue;
		            
		            int tmp = v1+v2+v3;
		            ans = Math.min(ans, tmp);
		        }
		    }
		    System.out.println(ans);
        }
	}
	
	static int calcMinCost(int start, int goal) {
	    int minCost[] = new int[N];
        for(int i=0; i<N; i++) {
            minCost[i] = Integer.MAX_VALUE;
        }
        minCost[start] = stayCost[start];
        boolean flag[] = new boolean[N];
        
        Queue<Integer> q = new LinkedList<>();
        q.add(start);
        
        while(true) {
            Integer now = q.poll();
            if(now == null) break;
            
            flag[now] = true;
            
            for(int i=0; i<N; i++) {
                if(i==now) continue;
                if(moveCost[now][i] > 0 && flag[i] == false) {
                    int tmp = minCost[now] + moveCost[now][i];
                    minCost[i] = Math.min(minCost[i], tmp);
                    q.add(i);
                }
            }
        }
        return minCost[goal];
	}
}