#include<queue>
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long 

ll N,M,Q,vi[1111],s,c,d,ans=0;
struct T{
	ll y,Next,lo;
}e[111111];
ll Link[111111],len=0;
bool f[111];

ll read(){
	char ch=getchar();ll x=0,f=1;
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void insert(ll xx,ll yy,ll vv){
	e[++len].Next=Link[xx];Link[xx]=len;e[len].y=yy;e[len].lo=vv;
}
void dfs(ll st,ll sd){
	if(sd>d||f[st])return ;
	if(vi[st]>c&&sd){
		if(!f[st])ans++,f[st]=1;
		return ;
	}
	for(int i=Link[st];i;i=e[i].Next){
		ll v=e[i].y;
		dfs(v,sd+e[i].lo);
	}
	return ;
}
void init(){
	N=read(),M=read(),Q=read();
	for(int i=1;i<=N;i++) vi[i]=read();
	for(int i=1;i<=M;i++){
		ll xx=read(),yy=read(),vv=read();
		insert(xx,yy,vv);
		insert(yy,xx,vv);
	}
}
int main(){
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	init();
	memset(f,0,sizeof(f));
	if(N<=10&&M<=20&&Q==1){
		s=read(),c=read(),d=read();
		dfs(s,0);
		cout<<ans<<endl;
		return 0;
	}
	else {
		for(int i=1;i<=Q;i++){
			memset(f,0,sizeof(f));
			s=read(),c=read(),d=read();
			dfs(s,0);
			cout<<ans<<endl;
			ans=0;
		}
	}
	return 0;
}