#include<cstdio>

#include<iostream>

#include<cstring>

#include<queue>

#define R register int

#define mp make_pair

const int N=,M=;

using namespace std;

inline int g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

}

int n,m,t,cnt;

int vr[M<<],nxt[M<<],w[M<<],fir[N];

long long sz[N],d[N],ans,c[N];

bool vis[N];

inline void add(int u,int v,int ww)  {vr[++cnt]=v,w[cnt]=ww,nxt[cnt]=fir[u],fir[u]=cnt;}

int vv[M<<],nn[M<<],ww[M<<],ff[N];

inline void aadd(int u,int v,int w) {vv[++cnt]=v,ww[cnt]=w,nn[cnt]=ff[u],ff[u]=cnt;}

priority_queue<pair<long long,int> > q;

inline void dijk() {

    memset(d,0x3f,sizeof(long long)*(n+)); d[]=; q.push(mp(,));

    while(q.size()) {

        R u=q.top().second; q.pop(); if(vis[u]) continue; vis[u]=true;

        for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

            if(d[v]>d[u]+w[i]) d[v]=d[u]+w[i],q.push(mp(-d[v],v));

        }

    }

}

void dfs(int u) { vis[u]=true;

    for(R i=ff[u];i;i=nn[i]) { R v=vv[i];

        if(vis[v]) continue; dfs(v); sz[u]+=sz[v];

    } ans=max(sz[u]*(d[u]-t),ans);//,cout<<u<<" "<<sz[u]<<" "<<d[u]<<" "<<t<<" "<<sz[u]*(d[u]-t)<<endl;

}

signed main() {

    n=g(),m=g(),t=g(); for(R i=;i<=n;++i) sz[i]=g(); for(R i=,u,v,w;i<=m;++i) u=g(),v=g(),w=g(),add(u,v,w),add(v,u,w); cnt=;

    dijk(); memset(vis,false,sizeof(vis)); for(R u=;u<=n;++u) for(R i=fir[u];i;i=nxt[i])

        if(d[vr[i]]==d[u]+w[i]&&!vis[vr[i]]) vis[vr[i]]=true,aadd(u,vr[i],w[i]),aadd(vr[i],u,w[i]);

    memset(vis,false,sizeof(bool)*(n+)); dfs(); printf("%lld\n",ans);

}