#![allow(unused_imports, dead_code, unused_macros, unused_variables, non_snake_case, unused_parens)]
use proconio::{input,marker::{Bytes, Chars, Usize1,Isize1}};
use std::ops::*;
use std::cmp::*;
use std::mem::swap;
use std::collections::*;
use itertools::*;
use num::integer::*;

const MOD:u64 = 1_000_000_007;
const INF:usize = 0x3fff_ffff_ffff_ffff;
const YES:&str="Yes";const NO:&str="No";macro_rules!yesno{($var:expr) => {if $var{println!("{}",YES);}else{println!("{}",NO);}}}

macro_rules! min {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::min($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::min($a, min!($($rest),+))}};}
macro_rules! max {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::max($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::max($a, max!($($rest),+))}};}
macro_rules! chmin {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_min = min!($($cmps),+);if $base > cmp_min {$base = cmp_min;true} else {false}}};}
macro_rules! chmax {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_max = max!($($cmps),+);if $base < cmp_max {$base = cmp_max;true} else {false}}};}
macro_rules! mulvec {($x:expr; $s:expr) => {vec![$x; $s]};($x:expr; $s0:expr; $( $s:expr );+) => {mulvec![vec![$x; $s0]; $( $s );+ ]};}
macro_rules! outputln {($var:expr)=>{println!("{}",$var)};($var:expr,$($vars:expr),+)=>{print!("{} ",$var);outputln!($($vars),+);};}
macro_rules! debug {($($a:expr),* $(,)*) => {eprintln!(concat!($("| ",stringify!($a), "={:?} "),*, "|"),$(&$a),*);};}




fn main() {
	input! {
		N: usize,
		M: usize,
		UVW: [(Usize1,Usize1, usize); M],
		A: [usize; N],
		B: [usize; N],
		C: [usize; N],
	}
	let mut edge = vec![vec![]; N];
	for (u,v,w) in UVW {
		edge[u].push((v,w));
		edge[v].push((u,w));
	}
	let mut que = BinaryHeap::new();
	que.push((Reverse(A[0]), 0));
	let mut dist = vec![INF; N];
	let mut visited = vec![false;N];
	dist[0] = A[0];
	while let Some((Reverse(t), v)) = que.pop() {
		if visited[v] {continue}
		visited[v] = true;
		dist[v] = t;
		for &(to, w) in &edge[v] {
			if visited[to] {continue}
			let mut t2 = (t + A[v]-1) / A[v] * A[v];
			let k = t2 / A[v];
			if k % B[v] == 0 {
				t2 += C[v];
			}
			t2 += w;
			if dist[to] <= t2 {
				continue;
			}
			// dist[to] = t2;
			que.push((Reverse(t2), to));
		}
	}
	outputln!(dist[N-1]);



}