#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<P>> to(n);
  rep(_, m) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    to[u].emplace_back(v, w);
    to[v].emplace_back(u, w);
  }
  constexpr long long INF = 1002003004005006007;
  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> q;
  VL dist(n, INF);
  dist[0] = 1;
  q.emplace(1, 0);
  VI a(n), b(n), c(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  rep(i, n) cin >> c[i];
  while (q.size()) {
    auto [d, u] = q.top(); q.pop();
    if (d != dist[u]) continue;
    ll k = (d + a[u] - 1) / a[u];
    for (auto [v, w] : to[u]) {
      if (k % b[u]) {
        ll nd = k * a[u] + w;
        if (chmin(dist[v], nd)) q.emplace(nd, v);
      } else {
        ll nd = k * a[u] + w;
        if (chmin(dist[v], nd + c[u])) q.emplace(nd + c[u], v);
        nd += a[u];
        if (chmin(dist[v], nd)) q.emplace(nd, v);
      }
    }
  }
  cout << dist[n-1] << '\n';
}