#ifndef ONLINE_JUDGE
// #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


struct Edge{ll to,cost=1;};
bool operator>(Edge a,Edge b){
  return a.cost>b.cost;
}
vector<ll> a0,a1,a2;
void dijkstra(vector<vector<Edge>> &graph,ll s,vector<ll> &dis){
  priority_queue<Edge,vector<Edge>,greater<Edge>> q;
  dis=vector<ll>(graph.size(),inf);
  q.push({s,a0[s]});
  dis[s]=a0[s];
  while(!q.empty()){
    ll f=q.top().to,c=q.top().cost;
    // cout<<f+1<<" "<<c<<"\n";
    q.pop();
    if(f==graph.size()-1) return;
    if(dis[f]<c) continue;
    for(auto i:graph[f]){
      ll nec=min(((dis[f]-1)/a0[f]+1)*a0[f]+i.cost+(((dis[f]-1)/a0[f]+1)%a1[f]==0)*a2[f],((dis[f]-1)/a0[f]+1)*(1+a0[f])+i.cost);
      // cout<<i.to+1<<" "<<nec<<"a\n";
      if(dis[i.to]<nec) continue;
      dis[i.to]=nec;
      q.push({i.to,dis[i.to]});
    }
  }
}

int main(){
  ll n,m,u,v,c;
  cin>>n>>m;
  auto w=vec<Edge>({n,0},{0,0});
  a0=vec<ll>({n},0);
  a1=vec<ll>({n},0);
  a2=vec<ll>({n},0);
  for(ll i=0;i<m;i++){
    cin>>u>>v>>c;
    w[--u].push_back({--v,c});
    w[v].push_back({u,c});
  }
  for(ll i=0;i<n;i++) cin>>a0[i];
  for(ll i=0;i<n;i++) cin>>a1[i];
  for(ll i=0;i<n;i++) cin>>a2[i];
  auto dis=vec<ll>({n},0);
  dijkstra(w,0,dis);
  cout<<dis[n-1]<<"\n";
}