#include<bits/stdc++.h>
using namespace std;
// define
#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define se second
#define fi first
#define all(v) (v).begin() , (v).end()
#define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin())
#define bit(x,i) (((x) >> (i)) & 1LL)
#define flip(x,i) ((x) ^ (1LL << (i)))
#define ms(d,x) memset(d , x , sizeof(d))
#define exist __exist
#define ends __ends
#define visit visited
#define left __left
#define right __right
#define sitingfake 1
#define orz 1
//constant
const long long mod = 1e9 + 7;
const long long linf = 4557430888798830399LL;
const long long nlinf = -4485090715960753727LL;
const int inf = 1061109567;
const int ninf = -1044266559;
const int dx[] = {0 , -1 , 0 , 1};
const int dy[] = {-1 , 0 , 1 , 0};
template<typename T> bool maximize(T &a, const T &b)
{
if(a < b) {a = b; return 1;}
return 0;
}
template<typename T> bool minimize(T &a, const T &b)
{
if(a > b) {a = b; return 1;}
return 0;
}
void Plus(ll & a ,ll b)
{
b %= mod;
a += b;
if(a < 0) a += mod;
a %= mod;
return;
}
void Mul(ll & a, ll b)
{
(a *= (b % mod)) %= mod;
return;
}
//code
const int maxn = 1e5 + 7;
ll dist0[maxn];
vector <ll> dist1[maxn];
ll sum[2 * maxn];
int n , m;
struct edges
{
int v;
int from;
int c;
int w;
};
vector <edges> adj[maxn];
void solve(void)
{
cin >> n >> m;
for(int i = 1; i <= m; i++)
{
int u , v , c , w;
cin >> u >> v >> c >> w;
int szu = adj[u].size();
int szv = adj[v].size();
adj[u].push_back({v , szv , c , w});
adj[v].push_back({u , szu , c , w});
}
for(int i = 1; i <= n; i++)
{
if(i != 1) dist1[i] = vector <ll> (adj[i].size() + 1 , linf);
else dist1[i] = vector <ll>(adj[i].size() + 1 , 0);
}
priority_queue <pair <ll , iii> ,vector<pair <ll , iii>> , greater <pair <ll , iii>>> pq;
ms(dist0 , 0x3f);
dist0[1] = 0;
pq.push({0 , {1 , {adj[1].size() , 0}}});
while(!pq.empty())
{
int u = pq.top().se.fi;
ll cost = pq.top().fi;
int from = pq.top().se.se.fi;
int t = pq.top().se.se.se;
pq.pop();
if(t == 0 && dist0[u] < cost)
{
continue;
}
else if(t == 1 && dist1[u][from] < cost)
{
continue;
}
for(int i = 0; i < adj[u].size(); i++)
{
if(i == from && t == 1) continue;
sum[adj[u][i].c] += adj[u][i].w;
}
for(int i = 0; i < adj[u].size(); i++)
{
if(i == from) continue;
int v = adj[u][i].v;
int to = adj[u][i].from;
int color = adj[u][i].c;
ll w = adj[u][i].w;
if(minimize(dist1[v][to] , cost + w))
{
pq.push({dist1[v][to] , {v , {to , 1}}});
}
if(minimize(dist0[v] , cost + sum[color] - w))
{
pq.push({dist0[v] , {v , {to , 0}}});
}
}
for(int i = 0; i < adj[u].size(); i++)
{
if(i == from && t == 1) continue;
sum[adj[u][i].c] -= adj[u][i].w;
}
}
ll ans = dist0[n];
for(int i = 0; i < adj[n].size(); i++)
{
ans = min(ans , dist1[n][i]);
}
if(ans == linf) cout << "-1";
else cout << ans;
}
/**
**/
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define task ""
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) solve();
// execute;
}
