#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,m,head[500050],cnt=0,tot,mp[200020],sum[200020],ans[500050];
struct Node{
	ll nxt,to,c,p;
}e[2000020];
struct node{
	ll id,dis;
};
il bl operator<(const node &xx,const node &yy){
	return xx.dis>yy.dis;
}
il void add(ll u,ll v,ll cc,ll pp){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	e[cnt].c=cc;
	e[cnt].p=pp;
	head[u]=cnt;
}
il void dijkstra(){
	priority_queue<node> q;
	q.push((node){1,0});
	fr(i,2,tot) ans[i]=inf;
	while(!q.empty()){
		node u=q.top();
		q.pop();
		if(u.id==n) break;
		if(ans[u.id]<u.dis) continue;
		go(u.id){
			ll v=e[i].to;
			if(ans[v]>(ans[u.id]+e[i].p)){
				ans[v]=ans[u.id]+e[i].p;
				q.push((node){v,ans[v]});
			}
		}
	}
}
int main(){
	n=read();
	m=read();
	fr(i,1,m){
		ll u=read(),v=read(),c=read(),p=read();
		add(u,v,c,p);
		add(v,u,c,p);
	}
	tot=n;
	fr(u,1,n){
		go(u) sum[e[i].c]+=e[i].p;
		go(u){
			if(!e[i].c) continue;
			ll v=e[i].to;
			if(!mp[e[i].c]){
				mp[e[i].c]=++tot;
				add(u,mp[e[i].c],0,0);
			}
			add(v,mp[e[i].c],0,0);
			add(mp[e[i].c],v,0,sum[e[i].c]-e[i].p);
		}
		go(u) sum[e[i].c]=mp[e[i].c]=0;
	}
	dijkstra();
	if(ans[n]==inf) ans[n]=-1;
	write(ans[n]);
}
/*
建虚点，跑最短路
有各种各样的建边方法，我不理解
*/