#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
x+=y;
if(x<0){
x%=mod;
x+=mod;
}else{
if(x>=mod) x%=mod;
}
return x;
}
ll mul(ll a,ll b){
ll ans = (a*b)%mod;
if(ans<0) ans+=mod;
return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 100005
ll n,m;
map<ll,vector<pll> > g[maxn];
map<ll,ll> scol[maxn];
map<ll,ll> dis[maxn];
ll dis2[maxn];
struct str{
ll u,d,c;
};
bool cmp(str a,str b){
return a.d>b.d;
}
priority_queue<str,vector<str>,decltype(&cmp)> pq(cmp);
void tc(){
cin >> n >> m;
for(ll i = 1;i<=m;i++){
ll x,y,c,w; cin >> x >> y >> c >> w;
g[x][c].pb({y,w});
g[y][c].pb({x,w});
scol[x][c]+=w;
scol[y][c]+=w;
}
fill(dis2,dis2+maxn,llinf);
dis2[1] = 0;
pq.push({1,0,0});
while(sz(pq)){
str cur = pq.top();
pq.pop();
ll u = cur.u;
ll d = cur.d;
ll c = cur.c;
if(c){
if(dis[u][c]!=d) continue;
for(pll p : g[u][c]){
ll v = p.fi;
ll w = p.sc;
if(dis2[v]>scol[u][c]+d-w){
dis2[v] = scol[u][c]+d-w;
pq.push({v,dis2[v],0});
}
}
}else{
if(dis2[u]!=d) continue;
for(auto r : g[u]){
ll col = r.fi;
for(pll p : r.sc){
ll v = p.fi;
ll w = p.sc;
ll dcur = min(scol[u][col]-w,w);
if(dis2[v]>d+dcur){
dis2[v] = d+dcur;
pq.push({v,dis2[v],0});
}
if(dis[v].find(col)==dis[v].end()||dis[v][col]>d){
dis[v][col] = d;
pq.push({v,dis[v][col],col});
}
}
}
}
}
ll ans = dis2[n];
if(ans==llinf) ans = -1;
cout<<ans<<endl;
}
int main(){
daj_mi_malo_vremena
int t; t = 1;
while(t--){
tc();
}
return 0;
}
