#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if (p != -1) { x =(x%p+p)%p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; template struct edge{ int to; T cost; edge(int a,T b):to(a),cost(b){} }; template vector dijkstra(vector>> &g,int s){ vectordis(g.size(),numeric_limits::max()); using P=pair; priority_queue,greater<>>pq; pq.emplace(0,s); dis[s]=0; while(!pq.empty()){ auto p=pq.top();pq.pop(); T d=p.first; int v=p.second; if(dis[v]>n>>m; constexpr int V=2005; vector>>g(n*V); vectora(m),b(m),c(m),t(n); rep(i,m){ cin>>a[i]>>b[i]>>c[i]; a[i]--;b[i]--; } rep(i,n)cin>>t[i]; rep(i,m){ rep(time,V){//到着時点でしおむずびを食べていた時間 if(a[i]*V+t[a[i]]+time0)g[a[i]*V+t[a[i]]+time].eb(b[i]*V+t[a[i]]+t[b[i]]+time,t[b[i]]+c[i]/(time+t[a[i]])); if(b[i]*V+t[b[i]]+time0)g[b[i]*V+t[b[i]]+time].eb(a[i]*V+t[b[i]]+t[a[i]]+time,t[a[i]]+c[i]/(time+t[b[i]])); } } auto d=dijkstra(g,t[0]); int ans=1e9; rep(i,V)chmin(ans,d[(n-1)*V+i]); cout<