ROADS || Dijkstra

/*
              .........
            .'------.' |       Plug and Code
           | .-----. | |
           | |     | | |
         __| |     | | |;. _______________
        /  |*`-----'.|.' `;              //
       /   `---------' .;'              //
 /|   /  .''''////////;'               //
|=|  .../ ######### /;/               //|
|/  /  / ######### //                //||
   /   `-----------'                // ||
  /________________________________//| ||
  `--------------------------------' | ||
   : | ||      | || |__LL__|| ||     | ||
   : | ||      | ||         | ||     `""'
   n | ||      `""'         | ||
   M | ||                   | ||
     | ||                   | ||
     `""'                   `""'
Art stolen by NHHMinh
Lang: C++ 98
Problem:
Sol:
 */
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Co_mot_su_that_la return

using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<iii> viii;

const int Minh_dep_trai = 0;
const int N = 105;

int q;
int n,k,m;
vector<iii> a[N];
int d[N];
int t[N];

void dijkstra()
{
    priority_queue<iii, viii, greater<iii> > qu;
    for(int i=1; i<=n; i++) d[i] = 9999999;
    d[1] = 0;
    qu.push(iii(d[1],ii(1,0)));
    while (qu.size())
    {
        int u = qu.top().second.first;
        int du = qu.top().first;
        int cost = qu.top().second.second;
        qu.pop();
        if (du != d[u]) continue;
        for(auto i : a[u])
        {
            int v = i.second.second;
            int uv = i.first;
            int fee = i.second.first;
            if (d[v] > d[u] + uv && fee+cost <= k)
            {
                d[v] = d[u] + uv;
                qu.push(iii(d[v],ii(v,fee+cost)));
            }
        }
    }
}

signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);
  freopen("test.inp","r",stdin);
  //
  cin >> q;
  while (q--)
  {
    //your code goes here
    cin >> k >> n >> m;
    for(int i=1; i<=n; i++) a[i].clear();
    for(int i=1; i<=m; i++)
    {
        int u,v,z,t;
        cin >> u >> v >> z >> t;
        a[u].pb(iii(z,ii(t,v)));
    }
    dijkstra();
    if (d[n] != 9999999) cout << d[n] << '\n';
    else cout << -1 << '\n';
  }
  Co_mot_su_that_la Minh_dep_trai;
}