#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int read(){int z=0,mark=1;  char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')mark=-1;  ch=getchar();}
	while(ch>='0'&&ch<='9'){z=(z<<3)+(z<<1)+ch-'0';  ch=getchar();}
	return z*mark;
}
struct ddd{int next,y,evalue;}e[21000];int LINK[110],ltop=0;
inline void insert(int x,int y,int z){e[++ltop].next=LINK[x];LINK[x]=ltop;e[ltop].y=y;e[ltop].evalue=z;}
int n,m,q,a[110];
bool visited[110];
int _s,_c,_d;
int dfs(int x,int y){
	int ge=0;
	for(int i=LINK[x];i;i=e[i].next)if(!visited[e[i].y] && y+e[i].evalue<=_d){
		visited[e[i].y]=true;
		ge++;
		if(a[e[i].y]<=_c)  ge+=dfs(e[i].y,y+e[i].evalue);
	}
	return ge;
}
int main(){
	//freopen("ddd.in","r",stdin);
	//freopen("PIA.out","w",stdout);
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++)  a[i]=read();
	int _left,_right,_value;
	while(m --> 0){//趋向于
		_left=read(),_right=read(),_value=read();
		insert(_left,_right,_value),insert(_right,_left,_value);
	}
	while(q --> 0){//趋向于
		_s=read(),_c=read(),_d=read();
		memset(visited,0,sizeof(visited));
		visited[_s]=true;
		printf("%d\n",dfs(_s,0));
	}
	return 0;
}