#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<pair<int,pair<int,int>>>temp[100005];
vector<pair<int,int>>adj[100005];
set<pair<int,int>>s;
int val[200005];
int cnt[200005];
int dis[200005];
int inf=1e18;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m;cin>>n>>m;
for(int i=1;i<=m;i++){
int a,b,c,p;cin>>a>>b>>c>>p;
temp[a].push_back({b,{c,p}});
temp[b].push_back({a,{c,p}});
}
for(int i=1;i<=m;i++)s.insert({0,i});
for(int i=1;i<=n;i++){
for(auto x:temp[i]){
int c=x.second.first;
int p=x.second.second;
cnt[c]++;
s.erase({val[c],c});
val[c]+=p;
s.insert({val[c],c});
}
for(auto x:temp[i]){
int go=x.first;
int c=x.second.first;
int p=x.second.second;
if(cnt[c]==1)adj[i].push_back({go,0});
else{
s.erase({val[c],c});
val[c]-=p;
s.insert({val[c],c});
adj[i].push_back({go,s.begin()->first+p});
s.erase({val[c],c});
val[c]+=p;
s.insert({val[c],c});
}
}
for(auto x:temp[i]){
int c=x.second.first;
int p=x.second.second;
cnt[c]++;
s.erase({val[c],c});
val[c]-=p;
s.insert({val[c],c});
}
}
for(int i=1;i<=n;i++)dis[i]=inf;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
pq.push({0,1});
while(!pq.empty()){
auto [cost,u]=pq.top();
pq.pop();
if(dis[u]!=inf)continue;
dis[u]=cost;
for(auto x:adj[u]){
pq.push({cost+x.second,x.first});
}
}
if(dis[n]==inf)cout<<"-1\n";
else cout<<dis[n];
}
