#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#define LL long long
#define Inf 0x7f7f7f7f
#define Begin freopen("snackstore.in","r",stdin);freopen("snackstore.out","w",stdout);
#define End fclose(stdin);fclose(stdout);
using namespace std;
const int maxn=15000;
struct Edge{
	int next,to,dis;
}e[maxn*4];
int v[maxn],n,m,ques,len,head[maxn],st,costmax,maxdis;
int size[maxn];
int vis[maxn];
void Init();
void Insert(int x,int y,int z){
	len++;e[len].to=y;e[len].next=head[x];e[len].dis=z;head[x]=len;
}
int Dfs(int x,int now){
	int tot;
	if(x==st || now>maxdis)return 0;
	if(v[x]>costmax){
		if(vis[x])return 0;
		else {vis[x]=1;return 1;}
	}
	if(vis[x]){
		if(vis[x]>now)tot=0;
		else return 0;
	}
	else tot=1;
	vis[x]=now;
	for(int i=head[x];i;i=e[i].next){
		int j=e[i].to;
		tot+=Dfs(j,now+e[i].dis);
	}
	return tot;
}
int main(){
    Begin;
    Init();
    //system("pause");
    End;
    return 0;
}
void Init(){
	scanf("%d%d%d",&n,&m,&ques);
	for(int i=1;i<=n;i++)scanf("%d",&v[i]);
	for(int i=1;i<=m;i++){
		int x,y,z;scanf("%d%d%d",&x,&y,&z);
		Insert(x,y,z);Insert(y,x,z);
	}
	for(int i=1;i<=ques;i++){
		scanf("%d%d%d",&st,&costmax,&maxdis);
		memset(vis,0,sizeof(vis));
		int ans=0;vis[st]=1;
		for(int j=head[st];j;j=e[j].next){
			int k=e[j].to;
			ans+=Dfs(k,e[j].dis);
		}
		printf("%d\n",ans);
	}
}