/*
* @Author: RMQuan
* @Date: 2025-09-29 22:50:45
* @Last Modified by: RMQuan
* @Last Modified time: 2025-09-30 05:25:33
*/
#include <bits/stdc++.h>
bool M1;
#define int long long
#define ll long long
#define fi first
#define se second
#define memfull(a,b) memset(a,b,sizeof(a));
#define endl '\n'
#define file(a) freopen(a".inp","r",stdin); freopen(a".out","w",stdout);
using namespace std;
const int maxn=2e5+7;
const int inf=1e18;
struct Edge {int to,w,col;};
struct Edge2 {int to,w;};
int n,m;
vector<Edge> adj[maxn];
vector<int> avaiable_col[maxn];
vector<vector<Edge2>> g[maxn];
vector<vector<long long>> psum(maxn);
vector<vector<int>> cntc(maxn);
vector<int> dis[maxn];
vector<int> vst[maxn];
struct node {
int u,idx,dist;
};
struct cmp {
bool operator()(const node &a,const node &b) const {
return a.dist>b.dist;
}
};
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++) {
int u,v,c,w;
cin>>u>>v>>c>>w;
adj[u].push_back({v,w,c});
adj[v].push_back({u,w,c});
avaiable_col[u].push_back(c);
avaiable_col[v].push_back(c);
}
for(int u=1;u<=n;u++) {
avaiable_col[u].push_back(-inf);
sort(avaiable_col[u].begin(),avaiable_col[u].end());
avaiable_col[u].erase(unique(avaiable_col[u].begin(),avaiable_col[u].end()),avaiable_col[u].end());
int sz=avaiable_col[u].size();
dis[u].assign(sz,inf);
vst[u].assign(sz,0);
g[u].assign(sz,{});
psum[u].assign(sz,0);
cntc[u].assign(sz,0);
for(auto &e:adj[u]) {
int idx=lower_bound(avaiable_col[u].begin(),avaiable_col[u].end(),e.col)-avaiable_col[u].begin();
g[u][idx].push_back({e.to,e.w});
psum[u][idx]+=e.w;
cntc[u][idx]++;
}
}
priority_queue<node,vector<node>,cmp> pq;
dis[1][0]=0;
pq.push({1,0,0});
while(!pq.empty()) {
auto cur=pq.top(); pq.pop();
int u=cur.u, idx=cur.idx;
ll du=cur.dist;
if(vst[u][idx]) continue;
vst[u][idx]=true;
if(idx==0) {
for(int j=1;j<(int)avaiable_col[u].size();j++) {
for(auto &e:g[u][j]) {
int v=e.to;
int cidx=lower_bound(avaiable_col[v].begin(),avaiable_col[v].end(),avaiable_col[u][j])-avaiable_col[v].begin();
if(cntc[u][j]<=1) {
if(dis[v][0]>du) {
dis[v][0]=du;
pq.push({v,0,du});
}
} else {
if(dis[v][cidx]>du) {
dis[v][cidx]=du;
pq.push({v,cidx,du});
}
if(dis[v][0]>du+e.w) {
dis[v][0]=du+e.w;
pq.push({v,0,dis[v][0]});
}
if(dis[v][0]>du+psum[u][j]-e.w) {
dis[v][0]=du+psum[u][j]-e.w;
pq.push({v,0,dis[v][0]});
}
}
}
}
} else {
for(auto &e:g[u][idx]) {
int v=e.to;
if(dis[v][0]>du+psum[u][idx]-e.w) {
dis[v][0]=du+psum[u][idx]-e.w;
pq.push({v,0,dis[v][0]});
}
}
}
}
cout<<(dis[n][0]==inf?-1:dis[n][0])<<endl;
bool M2;
cerr<<"-------------------------------------------------\n";
cerr<<"Time : "<<clock()<<" ms\n";
cerr<<"Memory : "<<abs(&M2-&M1)/1024/1024<<" MB\n";
cerr<<"-------------------------------------------------\n";
return 0;
}
