//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 105
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iii pair<int, ii>
#define viii vector<iii>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

struct node
{
    int v, w, c;
    node (int _v = 0, int _w = 0, int _c = 0) {v = _v; w = _w; c = _c;}
};

bool operator > (node a, node b)
{
    return a.c > b.c;
}

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

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> t;
}

void dijkstra()
{
    for(int i=1; i<=n; i++) d[i] = inf;
    priority_queue<iii, vector<iii>, greater<iii>> q;
    q.push(iii(0,ii(0,1)));
    while (q.size())
    {
        int u = q.top().se.se;
        int du = q.top().se.fi;
        int co = q.top().fi;
        q.pop();
        if (du >= d[u]) continue;
        d[u] = du;
        for(int i=0; i<a[u].size(); i++)
        {
            int v = a[u][i].fi;
            int uv = a[u][i].se.fi;
            int C = a[u][i].se.se;
            if (C+co <= k)
            {
                q.push(iii(C+co,ii(d[u]+uv,v)));
            }
        }
    }
}

void solve()
{
    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(v,ii(z,t)));
    }
    dijkstra();
    if (d[n]==inf) cout << -1 << endl;
    else cout << d[n] << endl;
}

void proc()
{
    while (t--)
    {
        solve();
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}