#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=400010, LOG=20;
int n, m, k, u, v, x, y, t, a, b;
int A[MAXN], B[MAXN], C[MAXN], P[MAXN];
ll P2[MAXN], sum[MAXN];
ll dist[MAXN<<1], ans;
bool mark[MAXN];
vector<int> G[MAXN];
priority_queue<pll, vector<pll>, greater<pll>> pq;
inline void upd(int v, ll d){ if (dist[v]>d) pq.push({dist[v]=d, v});}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=0; i<2*m; i++){
cin>>u>>v>>x>>y;
A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
swap(u, v);
i++;
A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
}
for (int i=1; i<=n; i++){
for (int j:G[i]) sum[C[j]]=0;
for (int j:G[i]) sum[C[j]]+=P[j];
for (int j:G[i]) P2[j]+=sum[C[j]];
}
memset(dist, 63, sizeof(dist));
for (int i:G[1]){
upd(i<<1, P2[i]-P[i]);
upd(i<<1 | 1, P[i]);
}
ans=INF;
while (pq.size()){
int st=pq.top().second;
pq.pop();
if (mark[st]) continue ;
mark[st]=1;
int id=(st>>1), last=(st&1);
int v=B[id];
if (v==n) ans=min(ans, dist[st]);
for (int i:G[v]){
upd(i<<1 | 1, dist[st]+P[i]);
if (last){
if (C[id]==C[i]){
upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
}
else{
upd(i<<1, dist[st]+P2[i]-P[i]);
}
}
else{
if (C[id]==C[i]){
// upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
}
else{
upd(i<<1, dist[st]+P2[i]-P[i]);
}
}
}
}
if (ans>=INF) ans=-1;
cout<<ans<<"\n";
return 0;
}
