#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif
#define hur(f, g) template<class c> int f(c a) {if (sizeof(c) == 8) return g##ll(a); else return g(a);}
hur(popc, __builtin_popcount) hur(ctz, __builtin_ctz) hur(clz, __builtin_clz)
/*
- place bitset modifications here
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>
#include <chrono>
#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define le(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)
#define apply(v, act) for (auto &x : v) { act; }
#define log(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}
inline int min(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^x; }
inline int max(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^y; }
inline long long min(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^x; }
inline long long max(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^y; }
#define print \
smart_io::precall_print(); \
cout,
#define scan cin,
#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
scanf("%c", &x);
if (x == '\n') {
fast_scan(x);
}
}
void fast_scan(string &x) {
scanf("%s", string_in_buffer);
x = string(string_in_buffer);
}
template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
fast_scan(p.first);
fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
for (auto &x : v) fast_scan(x);
}
void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const char &x) { printf("%c", x); };
// void fast_print(__int128 x) {
// if (x == 0) { fast_print('0'); return; }
// if (x < 0) {
// fast_print('-');
// x = -x;
// }
// __int128 p = 1;
// while (x / (p * 10)) p *= 10;
// while (p) {
// __int128 symb = x / p;
// fast_print((int)symb);
// x -= p * symb;
// p /= 10;
// }
// };
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }
template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
fast_print(p.first);
fast_print(' ');
fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print(' ');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print('\n');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const T &v) {
for (const auto &x : v) {
fast_print(x);
fast_print(' ');
}
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
fast_print(print_start);
print_start = "\n";
first_print = true;
}
void _print(deque<string>) {}
template<class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
if (!first_print) {
fast_print("\n");
} else {
first_print = false;
}
fast_print(names.front());
fast_print(" = ");
fast_print(elem);
names.pop_front();
_print(names, args...);
}
} //namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
if (!smart_io::first_print) {
fast_print(smart_io::sep);
} else {
smart_io::first_print = false;
}
fast_print(object);
return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
fast_scan(object);
return is;
}
namespace random {
using namespace std::chrono;
mt19937 rng(duration_cast< milliseconds >(
system_clock::now().time_since_epoch()
).count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};
#define int long long
namespace typedefs {
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long double ld;
}
namespace numbers_operation {
template<class T>
inline T floor_mod(T a, const T &b) {
a %= b;
if (a < 0) a += b;
return a;
}
}
using namespace numbers_operation;
using namespace typedefs;
using namespace random;
struct Edge {
int to, w, cost, id;
};
int n, m;
vector<vector<Edge>> g;
vector<vector<Edge>> reg;
struct EdgeX {
int a, b, w, cost;
};
vector<EdgeX> edges;
const int INF = 1e18;
pair<vector<int>, vector<int>> dijkstra(int base, const vector<vector<Edge>> &g, int forb=-1) {
vector<int> dist(n, INF);
dist[base] = 0;
// auto cmp = [&](int a, int b) {
// return dist[a] > dist[b];
// };
// priority_queue<pii, vector<pii>> deq;
// deq.push(mp(0, base));
vector<int> dom(n, -1);
vector<bool> used(n, false);
while (true) {
int v = -1;
for (int i = 0; i < n; i++) {
if (used[i]) continue;
if (v == -1 || dist[i] < dist[v]) {
v = i;
}
}
if (v == -1) break;
used[v] = true;
for (Edge e : g[v]) {
if (e.id == forb) continue;
if (dist[e.to] > dist[v] + e.w) {
dist[e.to] = dist[v] + e.w;
dom[e.to] = e.id;
}
}
}
return mp(dist, dom);
}
signed main(signed argc, char *argv[]) {
scan n, m;
g.resize(n); reg.resize(n);
f(i, m) {
int a, b, c, d;
scan a, b, c, d;
a--;b--;
g[a].pb({b, c, d, i});
reg[b].pb({a, c, d, i});
edges.pb({a, b, c, d});
}
vector<int> bases{0, n - 1};
int rez = dijkstra(0, g).x[n - 1] + dijkstra(n - 1, g).x[0];
vector<bool> crit(m, false);
{
vector<int> sus0 = dijkstra(0, g).y;
vector<int> sus1 = dijkstra(n - 1, g).y;
sus0.insert(sus0.end(), sus1.begin(), sus1.end());
sort(sus0.begin(), sus0.end());
sus0.resize(unique(sus0.begin(), sus0.end()) - sus0.begin());
for (int sus : sus0) {
if (sus == -1) continue;
crit[sus] = true;
int a = edges[sus].a;
int b = edges[sus].b;
int w = edges[sus].w;
int cost = edges[sus].cost;
g[b].pb({a, w, cost, m});
rez = min(rez,
cost + dijkstra(0, g, sus).x[n - 1] + dijkstra(n - 1, g, sus).x[0]
);
g[b].pop_back();
}
}
f(t, 2) {
vector<int> A = dijkstra(bases[0], g).x;
vector<int> ARev = dijkstra(bases[0], reg).x;
vector<int> B = dijkstra(bases[1], g).x;
vector<int> BRev = dijkstra(bases[1], reg).x;
for (int i = 0; i < m; i++) {
if (!crit[i]) {
rez = min(rez, edges[i].cost + edges[i].w
+ A[edges[i].b]
+ BRev[edges[i].a]
+ B[bases[0]]
);
rez = min(rez, edges[i].cost + edges[i].w
+ A[edges[i].b]
+ BRev[edges[i].a]
+ edges[i].w
+ B[edges[i].b]
+ ARev[edges[i].a]
);
}
}
swap(bases[0], bases[1]);
}
print rez >= INF ? -1 : rez;
}
