#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e17+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<vector<array<int,3> > > adj;
void dijkstra(vector<int> &spath, int sour) {
priority_queue<array<int,4>, vector<array<int,4> >, greater<array<int,4> > > que; //ignored, ignored_cost
que.push({0, sour, 0, 0});
while(que.size()) {
auto cur = que.top();
que.pop();
if(spath[cur[1]] != INF) {
continue;
}
spath[cur[1]] = cur[0];
unordered_map<int,int> sum, mpp;
for(auto c : adj[cur[1]]) {
mpp[c[1]]++;
sum[c[1]] += c[2];
}
mpp[cur[2]]--;
sum[cur[2]]-= cur[3];
for(auto c : adj[cur[1]]) {
if(spath[c[0]] != INF) continue;
if(mpp[c[1]] > 1) {
if(sum[c[1]] - c[2] >= c[2]) {
que.push({cur[0] + c[2], c[0], c[1], c[2]});
}
else {
que.push({cur[0] + sum[c[1]] - c[2], c[0], 0, 0});
}
}
else {
que.push({cur[0], c[0], 0, 0});
}
}
}
}
inline void solve() {
cin>>n>>m;
adj.resize(n+1, vector<array<int,3> >());
for(int i = 0; i<m; i++) {
int a,b,c,p;
cin>>a>>b>>c>>p;
adj[a].pb({b,c,p});
adj[b].pb({a,c,p});
}
vector<int> spath;
spath.assign(n+1, INF);
dijkstra(spath, 1);
if(spath[n] == INF) {
cout<<"-1\n";
}
else {
cout<<spath[n]<<"\n";
}
}
signed main() {
fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
