#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
#define ll long long
//#define int long long
//#pragma GCC optimize("Ofast, unroll-loop")
//#pragma GCC target("avx,avx2")
#pragma GCC optimize("O3")
const int inf=0x3f3f3f3f;
const ll inff=0x3f3f3f3f3f3f3f3f;
const int X=1000000007;
vector<array<int,4>> adj[100005];
vector<int> cs[100005];
priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> pq;
ll len[400005], ans=inff;
int col[400005];
int cnt(int u, int co){
return upper_bound(cs[u].begin(),cs[u].end(),co)-lower_bound(cs[u].begin(),cs[u].end(),co);
}
bool ch(int u, int e, int c){
return cnt(u,c)>1+(col[e]==c);
}
signed main(){
ios::sync_with_stdio(0), cin.tie(0);
memset(len,0x3f,sizeof len);
int n, m; cin >> n >> m;
for(int i=1 ; i<=m ; i++){
int a, b, c, p; cin >> a >> b >> c >> p;
adj[a].push_back({b,c,p,i<<1});
adj[b].push_back({a,c,p,i<<1|1});
cs[a].push_back(c);
cs[b].push_back(c);
col[i<<1]=c;
col[i<<1|1]=c;
}
for(int i=1 ; i<=n ; i++) sort(cs[i].begin(),cs[i].end());
len[1]=0;
pq.push({0,1,1});
while(!pq.empty()){
auto[l,u,e]=pq.top();
pq.pop();
if(len[e]<l) continue;
if(u==n) ans=min(ans,l);
for(auto[v,c,p,i]:adj[u]){
if(l+p*ch(u,e,c)<len[i]){
len[i]=l+p*ch(u,e,c);
pq.push({len[i],v,i});
}
}
}
cout << (ans==inff ? -1LL : ans) << '\n';
return 0;
}
