/*input
5 7
2 3 7 1
1 4 5 1
4 5 3 1
3 4 7 1
2 4 3 1
3 5 6 1
1 2 5 1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
if(a>=MOD) a%=MOD;
if(b>=MOD) b%=MOD;
return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1) res=mult(res,a);
a=mult(a,a);
b>>=1;
}
return res;
}
const int maxn=5e5+5;
const int maxlg=__lg(maxn)+2;
map<pii,int> mp;
int cnt=0;
vector<pair<pii,int>> v[maxn];
ll sum[maxn];
void add(int a,int b,int c,int d){
if(!mp.count({a,c})){
mp[{a,c}]=++cnt;
v[a].pb({{cnt,0},0});
}
int z=mp[{a,c}];
v[z].pb({{b,c},d});
sum[z]+=d;
}
ll dist[maxn];
priority_queue<pii,vector<pii>,greater<pii>> pq;
void upd(int x,ll d){
if(dist[x]<=d) return;
dist[x]=d;
pq.push({dist[x],x});
}
int32_t main(){
ios::sync_with_stdio(false),cin.tie(0);
int n,m;
cin>>n>>m;
cnt=n-1;
REP(i,m){
int a,b,c,d;
cin>>a>>b>>c>>d;
--a,--b;
add(a,b,c,d);
add(b,a,c,d);
}
REP(i,cnt+1) dist[i]=INF64;
dist[0]=0;
pq.push({0,0});
while(!pq.empty()){
int z=pq.top().s;
ll d=pq.top().f;
pq.pop();
if(dist[z]<d) continue;
if(z<n){
for(auto x:v[z]){
int col=x.f.f;
for(auto a:v[col]){
upd(a.f.f,d+min((ll)a.s,sum[col]-a.s));
upd(mp[a.f],d);
}
}
}
else{
for(auto x:v[z]){
upd(x.f.f,d+sum[z]-x.s);
}
}
}
if(dist[n-1]==INF64) dist[n-1]=-1;
cout<<dist[n-1];
}
