#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector g(n, vector < pair<int, long long>>());
	rep(i, m) {
		int u, v, w; cin >> u >> v >> w;
		u--, v--;
		g[u].emplace_back(v, w);
		g[v].emplace_back(u, w);
	}
	vector<int>a(n), b(n), c(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	rep(i, n)cin >> c[i];

	vector<long long>dp(n, LINF);
	dp[0] = 1;
	using S = std::pair<long long, int>;
	std::priority_queue<S, std::vector<S>, std::greater<S>> pq;
	pq.emplace(dp[0], 0);
	while (!pq.empty()) {
		auto [d, v] = pq.top();
		pq.pop();
		if (dp[v] != d)continue;
		for (auto [nv, add] : g[v]) {
			auto k = (d + a[v] - 1) / a[v];
			{
				long long nd = k * a[v] + add;
				if (k % b[v] == 0)nd += c[v];
				if (chmin(dp[nv], nd)) {
					pq.emplace(dp[nv], nv);
				}
			}
			if (k % b[v] == 0) {
				k++;
				long long nd = k * a[v] + add;
				if (k % b[v] == 0)nd += c[v];
				if (chmin(dp[nv], nd)) {
					pq.emplace(dp[nv], nv);
				}
			}
		}
	}
	cout << dp[n - 1] << endl;
	return 0;
}