#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll=long long;
using ldub=long double;
using lldub=__float128;
using str=string;

using mint=modint;

template<class T=ll>
using tup2=tuple<T,T>;
template<class T=ll>
using tup3=tuple<T,T,T>;
template<class T=ll>
using tup4=tuple<T,T,T,T>;
template<class T=ll>
using tup5=tuple<T,T,T,T,T>;
template<class T=ll>
using tup6=tuple<T,T,T,T,T,T>;
template<class T=ll>
using tup7=tuple<T,T,T,T,T,T,T>;

template<class T=ll>
using vec=vector<T>;
template<class T=ll>
using vec2=vector<vec<T>>;
template<class T=ll>
using vec3=vector<vec2<T>>;
template<class T=ll>
using vec4=vector<vec3<T>>;
template<class T=ll>
using vec5=vector<vec4<T>>;
template<class T=ll>
using vec6=vector<vec5<T>>;

template<class T>
using que=queue<T>;
template<class T>
using Pque=priority_queue<T>;
template<class T>
using pque=priority_queue<T, vector<T>, greater<T>>;

struct Edge{
  ll from,to,w=1,num=-1;
};
using gvec=vector<Edge>;
using gvec2=vector<gvec>;

template<class T>
bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,T b){if(b<a){a=b;return 1;}return 0;}

#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define tup make_tuple
#define low lower_bound
#define pops(a) __builtin_popcountll(a)
#define ctz(a) __builtin_ctzll(a)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define nperm(v) next_permutation(all(v))
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YN(f) cout << ((f)?"Yes":"No") << endl

const int IINF=2e9;
const ll INF=4e18;

#ifndef LOCAL
#define debug(x)
#endif




// =================================================




void solve(){
  ll N,M;
  cin >> N >> M;
  gvec2 G(N);
  gvec E(M);
  for(ll i=0;i<M;i++){
    ll u,v,w;
    cin >> u >> v >> w;
    u--,v--;
    E[i]={u,v,w,i};
    G[u].pb({u,v,w,i});
    G[v].pb({v,u,w,i});
  }
  vec A(N),B(N),C(N);
  for(ll i=0;i<N;i++) cin >> A[i];
  for(ll i=0;i<N;i++) cin >> B[i];
  for(ll i=0;i<N;i++) cin >> C[i];
  pque<tup2<ll>> BFS;
  vec D(N,INF);
  BFS.push(tup(1,0));
  D[0]=1;
  while(!BFS.empty()){
    auto [d,p]=BFS.top();
    BFS.pop();
    ll nd=(d+A[p]-1)/A[p]*A[p];
    if((nd/A[p])%B[p]==0) nd+=min(A[p],C[p]);
    for(auto e:G[p]) if(chmin(D[e.to],nd+e.w)) BFS.push(tup(nd+e.w,e.to));
  }
  cout << D[N-1] << endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  mint::set_mod(998244353);
  // mint::set_mod(1000000007);

  ll T=1;
  // cin >> T;
  while(T--) solve();
  return 0;
}