#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
#define MP make_pair
typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 1248;
int n, m;
int eu[N], ev[N], c[N], p[N];
vector<pair<int, int>> g[N];
ll MV(int v, int from, bool flag){
return (ll)v * (2 * m + 2) + from * 2 + flag;
}
ll total[N];
priority_queue<pair<ll, ll>> pq;
unordered_map<ll, ll> d;
void add(ll dist, ll ver){
if (d.find(ver) == d.end() || d[ver] > dist){
d[ver] = dist;
pq.push(MP(-dist, ver));
}
// int v = ver / (2 * m), i = ver % (2 * m) / 2;
// cout << v << ' ' << (eu[i] == v ? ev[i] : eu[i]) << ' ' << ver.second.second << ' ' << dist << endl;
}
void solve(int TC) {
cin >> n >> m;
for (int i = 1; i <= n; i++) g[i].clear();
while (!pq.empty()) pq.pop();
d.clear();
for (int i = 1; i <= m; i++){
int u, v;
cin >> u >> v >> c[i] >> p[i];
g[u].emplace_back(v, i);
g[v].emplace_back(u, i);
eu[i] = u, ev[i] = v;
}
// cerr << total[1][4] << endl;
add(0, MV(1, 0, false));
unordered_set<ll> processed;
while (!pq.empty()){
ll dist = -pq.top().first;
ll ver = pq.top().second;
pq.pop();
if (processed.find(ver) != processed.end()) continue;
processed.insert(ver);
int v = ver / (2 * m + 2), from = ver % (2 * m + 2) / 2;
bool flag = ver % 2;
if (v == n){
cout << dist << endl;
return;
}
for (auto e : g[v]){
int i = e.second;
total[c[i]] += p[i];
}
for (auto e : g[v]){
int u = e.first, i = e.second;
ll tot = total[c[i]] - (c[from] == c[i] && flag ? p[from] : 0);
// if (v == 2 && u == 4) cout << tot << endl;
if (i == from) continue;
assert(tot >= p[i]);
// cout << v << ' ' << (eu[from] == v ? ev[from] : eu[from]) << ' ' << flag << endl;
add(dist + tot - p[i], MV(u, i, false));
add(dist + p[i], MV(u, i, true));
}
for (auto e : g[v]){
int i = e.second;
total[c[i]] -= p[i];
}
}
cout << -1 << endl;
}
int main() {
startTime = clock();
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
#ifdef dddxxz
cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif
return 0;
}
