#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define inp(x) for(auto &i:x)cin>>i
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using boost::multiprecision::cpp_int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m;cin>>n>>m;
  const i128 inf=(i128(1)<<64)+1;
  vector<vector<pll>> G(n);
  rep(i,0,m){
    ll u,v,w;cin>>u>>v>>w;
    u--;v--;
    G[u].push_back({v,w});
    G[v].push_back({u,w});
  }
  vector<i128> D(n,inf);
  priority_queue<pair<i128,ll>,vector<pair<i128,ll>>,greater<pair<i128,ll>>> pq;
  vl A(n),B(n),C(n);inp(A);inp(B);inp(C);
  pq.push({1,0});
  while(!pq.empty()){
    auto [d,v]=pq.top();pq.pop();
    if(D[v]<=d)continue;
    D[v]=d;
    i128 k=(d-1)/A[v]+1;
    for(auto[to,w]:G[v]){
        pq.push({min(i128(A[v])*k+w+(k%B[v]==0?C[v]:0),i128(A[v])*(k+1)+w+((k+1)%B[v]==0?C[v]:0)),to});
    }
  }
  string ans="";
  auto x=D[n-1];
  while(x>0){
    ans+='0'+x%10;
    x/=10;
  }
  reverse(all(ans));
  cout<<ans<<el;
}