#include<iostream>
#include<stack>
#include<queue>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<cmath>
#define ll long long
#define oo 1000000007
#define MAXN 201010
#define MAXM 801010
using namespace std;
struct node
{
int u,v,d,next;
}line[MAXM];
struct NODE
{
int u,dis;
bool operator <(NODE a) const
{
return a.dis<dis;
}
};
int Lnum,_next[MAXN],dis[MAXN];
priority_queue<NODE> Q;
void addline(int u,int v,int d)
{
line[++Lnum].next=_next[u],_next[u]=Lnum;
line[Lnum].u=u,line[Lnum].v=v,line[Lnum].d=d;
}
bool used[MAXN];
int dijkstra(int s,int e)
{
NODE h,p;
memset(dis,-1,sizeof(dis));
memset(used,false,sizeof(used));
h.u=s,dis[h.u]=h.dis=0,Q.push(h);
while (!Q.empty())
{
h=Q.top(),Q.pop();
if (used[h.u]) continue;
used[h.u]=true;
for (int k=_next[h.u];k;k=line[k].next)
if (dis[line[k].v]==-1 || dis[line[k].v]>dis[h.u]+line[k].d)
{
dis[line[k].v]=dis[h.u]+line[k].d;
p.u=line[k].v,p.
dis=dis[line[k].v];
Q.push(p);
}
}
return dis[e];
}
int main()
{
int C,CA,cases,N,M,i,h,u,v,d,s,e;
scanf("%d",&CA);
for (cases=1;cases<=CA;cases++)
{
scanf("%d%d%d",&N,&M,&C);
Lnum=0,memset(_next,0,sizeof(_next));
for (i=1;i<=N;i++)
{
scanf("%d",&d);
addline(i,N+(d<<1),0),addline(N+(d<<1|1),i,0);
}
for (i=1;i<=N;i++)
{
addline(N+(i<<1),N+((i+1)<<1|1),C);
addline(N+(i<<1),N+((i-1)<<1|1),C);
}
s=1,e=N;
while (M--)
{
scanf("%d%d%d",&u,&v,&d);
addline(u,v,d),addline(v,u,d);
}
printf("Case #%d: %d\n",cases,dijkstra(s,e));
}
return 0;
}