#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> U(M);
    vector<ll> V(M);
    vector<ll> W(M);
    rep(i, M){
        cin >> U[i] >> V[i] >> W[i];
        U[i]--;
        V[i]--;
    }
    vector<vector<pll>> graph(N, vector<pll>(0));
    rep(i, M){
        graph[U[i]].push_back(make_pair(V[i], W[i]));
        graph[V[i]].push_back(make_pair(U[i], W[i]));
    }
    vector<ll> A(N);
    vector<ll> B(N);
    vector<ll> C(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];
    rep(i, N) cin >> C[i];

    rep(i, N){
        if (A[i] == 0) return 0;
        if (B[i] == 0) return 0;
    }

    ll INF = 300000000000000023LL;
    vector<ll> dist(N, INF);
    dist[0] = 1;

    priority_queue<pll, vector<pll>, greater<pll>> pque;
    pque.push(make_pair(1, 0));

    while (pque.size()){
        pll p = pque.top();
        pque.pop();

        ll pd = p.first;
        ll pe = p.second;
        if (pd > dist[pe]) continue;

        for (pll np: graph[pe]){
            ll ne = np.first;
            ll nd = ((pd + A[pe] - 1) / A[pe]) * A[pe];
            ll nd1 = nd + np.second;
            ll nd2 = nd + A[pe] + np.second;
            if ((nd / A[pe]) % B[pe] == 0) nd1 += C[pe];
            if ((nd / A[pe] + 1) % B[pe] == 0) nd2 += C[pe];
            if (dist[ne] > nd1){
                dist[ne] = nd1;
                pque.push(make_pair(nd1, ne));
            }
            if (dist[ne] > nd2){
                dist[ne] = nd2;
                pque.push(make_pair(nd2, ne));
            }
        }
    }
    // debug(dist);
    
    cout << (dist[N - 1] < INF ? dist[N - 1] : -1) << endl;
}