#include <iostream>

 #include <queue>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <algorithm>

 using namespace std;

 const int maxm = ;  //±ß

 const int maxn = ; //µã

 const int inf = 0x3f3f3f3f;

 struct Edge

 {

     int to,v,next;

 } edge[maxm];

 struct node

 {

     long long val;

     int num, h;

     node(long long _val=, int _num=, int _d=):val(_val), num(_num),h(_d) {}

     bool operator <(const node &tmp) const

     {

         return val > tmp.val;

     }

 };

 int head[maxn];

 int top;

 int N, M, K;

 long long dis[maxn][];

 bool vis[maxn][];

 long long ans = inf;

 void init()

 {

     memset(head, -, sizeof(head));

     top = ;

     for(int i=; i<=N; i++)

     {

         for(int j=; j<=K; j++)

         {

             dis[i][j] = inf;

             vis[i][j] = false;

         }

     }

     ans = inf;

 }

 void addedge(int from, int to, int v)

 {

     edge[top].to = to;

     edge[top].v = v;

     edge[top].next = head[from];

     head[from] = top++;

 }

 void dijkstra()

 {

     priority_queue<node> que;

     dis[][] = ;

     que.push(node(, , ));

     while(!que.empty())

     {

         node p = que.top();

         que.pop();

         int nown = p.num;

         int h = p.h;

         if(vis[nown][h])

             continue;

         vis[nown][h] = true;

         for(int i=head[nown]; i!=-; i=edge[i].next)

         {

             Edge e = edge[i];

             if(dis[e.to][h] > dis[nown][h] + e.v)

             {

                 dis[e.to][h] = dis[nown][h] + e.v;

                 que.push(node(dis[e.to][h], e.to, h));

             }

             //修改的地方

             if(dis[e.to][h+] > dis[nown][h] && h < K)

             {

                 dis[e.to][h+] = dis[nown][h];

                 que.push(node(dis[nown][h], e.to, h+));

             }

         }

     }

     for(int i=; i<=K; i++)

     {

         ans = min(ans, dis[N][i]);

     }

 }

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

         scanf("%d%d%d", &N, &M, &K);

         init();

         int u, v, c;

         for(int i=; i<M; i++)

         {

             scanf("%d%d%d", &u, &v, &c);

             addedge(u, v, c);

         }

         dijkstra();

         printf("%lld\n", ans);

     }

     return ;

 }