#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 205, M = 5e4 + 5;
const int inf = 1e9;
int n, m;
int pr[N], w[M], d[2][N], rd[2][N], f[2][N];
bool spec[M];
vector<array<int, 2>> g[N], rg[N];
array<int, 3> edges[M];
void dijkstra(int s, int *d, vector<array<int, 2>> *g) {
using T = array<int, 2>;
priority_queue<T, vector<T>, greater<T>> pq;
fill(d + 1, d + n + 1, inf);
fill(pr + 1, pr + n + 1, 0);
pq.push({d[s] = 0, s});
while (pq.size()) {
auto [c, u] = pq.top(); pq.pop();
if (c != d[u]) {
continue;
}
for (auto [v, id] : g[u]) {
if (d[v] > d[u] + w[id]) {
pr[v] = id;
pq.push({d[v] = d[u] + w[id], v});
}
}
}
}
void mark() {
for (int i = 1; i <= n; ++i) {
spec[pr[i]] = 1;
}
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v, c; cin >> u >> v >> w[i] >> c;
edges[i] = {u, v, c};
g[u].push_back({v, i});
rg[v].push_back({u, i});
}
dijkstra(1, d[0], g);
mark();
dijkstra(n, d[1], g);
mark();
dijkstra(1, rd[0], rg);
dijkstra(n, rd[1], rg);
auto del = [&](int u, array<int, 2> x) {
for (auto &v : g[u]) {
if (v == x) {
swap(v, g[u].back());
g[u].pop_back();
break;
}
}
};
auto add = [&](int u, array<int, 2> x) {
g[u].push_back(x);
};
int res = 2 * inf;
if (d[0][n] != inf && d[1][1] != inf) {
res = min(res, d[0][n] + d[1][1]);
}
for (int i = 1; i <= m; ++i) {
auto [u, v, c] = edges[i];
if (spec[i]) {
del(u, {v, i});
add(v, {u, i});
dijkstra(1, f[0], g);
dijkstra(n, f[1], g);
if (f[0][n] != inf && f[1][1] != inf) {
res = min(res, f[0][n] + f[1][1] + c);
}
del(v, {u, i});
add(u, {v, i});
} else {
int a = min(d[0][n], d[0][v] + rd[1][u] + w[i]);
int b = min(d[1][1], d[1][v] + rd[0][u] + w[i]);
if (a != inf && b != inf) {
res = min(res, a + b + c);
}
}
}
cout << (res != 2 * inf ? res : -1);
return 0;
}
