import java.io.IOException;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;

public class Main {
	int n, m;
	List<Integer>[] e;
	int[][] g;
	int[] cost;

	class D implements Comparable<D> {
		int pos;
		int pre;
		int min;

		D(int pos, int pre, int min) {
			this.pos = pos;
			this.pre = pre;
			this.min = min;
		}

		@Override
		public int compareTo(D o) {
			if (this.min != o.min) {
				return this.min - o.min;
			}
			if (this.pos != o.pos) {
				return this.pos - o.pos;
			}
			if (this.pre != o.pre) {
				return this.pre - o.pre;
			}
			return 0;
		}
	}

	int dijkstra() {
		PriorityQueue<D> queue = new PriorityQueue<D>();
		queue.add(new D(0, 0, 0));
		boolean[][] vis = new boolean[n][n + 1];

		while (!queue.isEmpty()) {
			D d = queue.poll();
			int pos = d.pos;
			int pre = d.pre;
			int min = d.min;
			if (pos == n - 1 && pre == n) {
				return min;
			}
			if (vis[pos][pre]) {
				continue;
			}
			vis[pos][pre] = true;

			for (Integer to : e[pos]) {
				queue.add(new D(to, pre, min + g[pos][to]));
			}
			if (0 < pos && pos < n - 1 && pos != pre && pre < n) {
				if (pre == 0) {
					queue.add(new D(pos, pos, min + cost[pos]));
				} else {
					queue.add(new D(pos, n, min + cost[pos]));
				}
			}
		}

		return -1;
	}

	void run() {
		MyScanner sc = new MyScanner();

		n = sc.nextInt();
		cost = sc.nextIntArray(n);
		m = sc.nextInt();
		e = new LinkedList[n];
		for (int i = 0; i < n; i++) {
			e[i] = new LinkedList<Integer>();
		}
		g = new int[n][n];
		for (int i = 0; i < m; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = sc.nextInt();
			g[a][b] = g[b][a] = c;
			e[a].add(b);
			e[b].add(a);
		}

		System.out.println(dijkstra());
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}