#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=4e4+5,M=1e5+5,K=20;
int n,m,mx,hd[N],xnt=1,to[M<<1],nxt[M<<1],w[M<<1];
int dis[N],sta[N],top,ans=1e9,bin[K];
bool vis[N],use[M];
priority_queue<pair<int,int> >q;
int rdn()
{int ret=0;bool fx=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')fx=0;ch=getchar();}while(ch>='0'&&ch<='9') ret=(ret<<3)+(ret<<1)+ch-'0',ch=getchar();return fx?ret:-ret;
}
void add(int x,int y,int z)
{to[++xnt]=y;nxt[xnt]=hd[x];hd[x]=xnt;w[xnt]=z;
}
void init()
{int k=n;while(k)k>>=1,mx++;mx--;bin[0]=1;for(int i=1;i<=mx;i++)bin[i]=bin[i-1]<<1;
}
void dj()
{memset(vis,0,sizeof vis);while(q.size()){int k=q.top().second;q.pop();if(vis[k])continue;vis[k]=1;for(int i=hd[k],v;i;i=nxt[i])if(!use[i>>1]&&dis[v=to[i]]>dis[k]+w[i]){dis[v]=dis[k]+w[i];q.push(make_pair(-dis[v],v));}}ans=min(ans,dis[1]);
}
int main()
{n=rdn(); m=rdn(); init();for(int i=1,u,v,z1,z2;i<=m;i++){u=rdn();v=rdn();z1=rdn();z2=rdn();add(u,v,z1);add(v,u,z2);}for(int i=hd[1];i;i=nxt[i])sta[++top]=i;for(int i=0;i<=mx;i++){memset(dis,0x3f,sizeof dis);for(int j=1;j<=top;j++){int k=sta[j];if(!(to[k]&bin[i])){q.push(make_pair(-w[k],to[k]));use[k>>1]=1;dis[to[k]]=w[k];}}dj();memset(dis,0x3f,sizeof dis);for(int j=1;j<=top;j++){int k=sta[j];if(to[k]&bin[i]){q.push(make_pair(-w[k],to[k]));use[k>>1]=1;dis[to[k]]=w[k];}else use[k>>1]=0;}dj();for(int j=1;j<=top;j++)if(to[sta[j]]&bin[i])use[sta[j]>>1]=0;}printf("%d\n",ans==1e9?-1:ans);return 0;
}