using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, m) = (c[0], c[1]); var map = NArr(m); var t = NList; var tree = new List<(int to, int len)>[n][]; for (var i = 0; i < tree.Length; ++i) { tree[i] = new List<(int to, int len)>[1001]; for (var j = 0; j < tree[i].Length; ++j) tree[i][j] = new List<(int to, int len)>(); } foreach (var edge in map) { var a = edge[0] - 1; var b = edge[1] - 1; for (var j = 1; j < 1001; ++j) { tree[a][j].Add((b, edge[2] / j)); tree[b][j].Add((a, edge[2] / j)); } } var INF = long.MaxValue / 2; var len = new long[n][]; for (var i = 0; i < n; ++i) len[i] = Enumerable.Repeat(INF, 1001).ToArray(); len[0][t[0]] = t[0]; var q = new PriorityQueue(n, false); q.Enqueue(new Pair(0, t[0], t[0])); while (q.Count > 0) { var cur = q.Dequeue(); if (len[cur.Pos][cur.Time] != cur.Val) continue; foreach (var next in tree[cur.Pos][cur.Time]) { var neat = Math.Min(1000, cur.Time + t[next.to]); var ntime = cur.Val + next.len + t[next.to]; if (len[next.to][neat] <= ntime) continue; len[next.to][neat] = ntime; q.Enqueue(new Pair(next.to, neat, ntime)); } } var ans = INF; for (var i = 1; i < 1001; ++i) ans = Math.Min(ans, len[n - 1][i]); WriteLine(ans); } class Pair : IComparable { public int Pos; public int Time; public int Val; public Pair(int pos, int time, int val) { Pos = pos; Time = time; Val = val; } public int CompareTo(Pair b) { return Val.CompareTo(b.Val); } } class PriorityQueue where T : IComparable { public T[] List; public int Count; bool IsTopMax; public PriorityQueue(int count, bool isTopMax) { IsTopMax = isTopMax; List = new T[Math.Max(128, count)]; } public void Enqueue(T value) { if (Count == List.Length) { var newlist = new T[List.Length * 2]; for (var i = 0; i < List.Length; ++i) newlist[i] = List[i]; List = newlist; } var pos = Count; List[pos] = value; ++Count; while (pos > 0) { var parent = (pos - 1) / 2; if (Calc(List[parent], List[pos], true)) break; Swap(parent, pos); pos = parent; } } public T Dequeue() { --Count; Swap(0, Count); var pos = 0; while (true) { var child = pos * 2 + 1; if (child >= Count) break; if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child; if (Calc(List[pos], List[child], true)) break; Swap(pos, child); pos = child; } return List[Count]; } bool Calc(T a, T b, bool equalVal) { var ret = a.CompareTo(b); if (ret == 0 && equalVal) return true; return IsTopMax ? ret > 0 : ret < 0; } void Swap(int a, int b) { var tmp = List[a]; List[a] = List[b]; List[b] = tmp; } } }