#include<iostream>
#include<vector>
#include<utility>
#include<queue>

using namespace std;
using ll = long long;

const int MAXLL=8e18;

int main(){
  int N,M;
  cin >> N >> M;
  vector<vector<pair<int,ll>>> edge(N+1);
  for(int i=0;i<M;i++){
    int U,V;
    ll W;
    cin >> U >> V >> W;
    edge[U].push_back({V,W});
    edge[V].push_back({U,W});
  }
  
  vector<ll> A(N+1,0);
  for(int i=1;i<=N;i++){
    cin >> A[i];
  }
  
  return 0;
  vector<ll> visited(N+1,MAXLL);
  priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> q;
  q.push({0LL,1});
  while(!q.empty()){
    auto [c,now]=q.top();
    q.pop();
    if(visited[now]>c){
      visited[now]=c;
      for(int i=0;i<edge[now].size();i++){
        int next=edge[now][i].first;
        ll t=((c+A[next]-1)/A[next])*A[next];
        if(visited[next]>t+edge[now][next].second){
          q.push({t+edge[now][next].second,next});
        }
      }
    }
  }
  
  if(visited[N]==MAXLL){
    cout << -1 << "\n";
  }else{
    cout << visited[N] << "\n";
  }
  
  return 0;
  
}