//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii tuple<ll,ll,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
struct edge{
ll v,c,p;
};
int n,m;
vector<edge> al[200005];
map<int,vector<edge> > al_c[200005];
map<int,ll> mc[200005];
map<int,ll> w[200005];
priority_queue<iii,vector<iii>,greater<iii> > pq;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>m;
int a,b,c,d;
rep(x,0,m){
cin>>a>>b>>c>>d;
al[a].pub({b,c,d});
al[b].pub({a,c,d});
al_c[a][c].pub({b,c,d});
al_c[b][c].pub({a,c,d});
mc[a][c]+=d;
mc[b][c]+=d;
w[a][c]=1e18;
w[b][c]=1e18;
}
rep(x,1,n+1) w[x][-1]=1e18;
w[1][-1]=0;
pq.push({w[1][-1],1,-1});
ll node,weight,col;
while (!pq.empty()){
tie(weight,node,col)=pq.top(),pq.pop();
if (w[node][col]!=weight) continue;
//cout<<weight<<" "<<node<<" "<<col<<endl;
if (al_c[node].count(col)) for (auto &it:al_c[node][col]){
ll nw=weight+mc[node][it.c]-it.p;
if (w[it.v][-1]>nw){
w[it.v][-1]=nw;
pq.push({nw,it.v,-1});
}
}
if (col==-1) for (auto &it:al[node]){
ll nw=weight;
if (w[it.v][it.c]>nw){
w[it.v][it.c]=nw;
pq.push({nw,it.v,it.c});
}
nw=weight+min(mc[node][it.c]-it.p,it.p);
if (w[it.v][-1]>nw){
w[it.v][-1]=nw;
pq.push({nw,it.v,-1});
}
}
}
if (w[n][-1]==1e18) cout<<"-1"<<endl;
else cout<<w[n][-1]<<endl;
}
