#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define N 100003
#define M 100003
using namespace std;
int read()
{int f=1,x=0;char s=getchar();while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}return x*f;
}
const int INF=0x3f3f3f3f;
struct qnode
{int v;int c;qnode(int _v=0,int _c=0):v(_v),c(_c){}bool operator <(const qnode &r)const{return c>r.c;}
};
struct Edge
{int v,cost;Edge(int _v=0,int _cost=0):v(_v),cost(_cost){}
};
vector<Edge> E[N*2+M];
bool vis[N*3];
int dist[N*3];void dij(int n,int start)//点的编号从1开始
{memset(vis,false,sizeof(vis));for(int i=1;i<=n;i++) dist[i]=INF;priority_queue<qnode> que;while(!que.empty()) que.pop();dist[start]=0;que.push(qnode(start,0));qnode tmp;while(!que.empty()){tmp=que.top();que.pop();int u=tmp.v;if(vis[u]) continue;vis[u]=true;for(int i=0;i<E[u].size();i++){int v=E[tmp.v][i].v;int cost=E[u][i].cost;if(!vis[v]&&dist[v]>dist[u]+cost){dist[v]=dist[u]+cost;que.push(qnode(v,dist[v]));}}}
}void add(int u,int v,int w)
{E[u].push_back(Edge(v,w));
}
int main()
{int T=read();for(int k=1;k<=T;++k){for(int i=0;i<=N*2+M;i++)if(!E[i].empty())E[i].clear();int n=read(),m=read(),c=read();for(int i=1;i<=n;++i){int x=read();add(x*2+n-1,i,0);add(i,x*2+n,0);}for(int i=1;i<=m;++i){int u=read(),v=read(),w=read();add(u,v,w);add(v,u,w);}for(int i=1;i<=n;++i){int u=2*i+n;if(i>1)add(u,u-3,c);if(i<n)add(u,u+1,c);}dij(3*n,1);printf("Case #%d: %d\n",k,(dist[n]==INF?-1:dist[n]));}
}
/*
*/