#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=105;
int n,m,q,cnt,head[N],V[N];
ll vis[N],dis[N];
struct edge{
	int v,w,next;
}e[N*N<<1];
void addedge(int u,int v,int w){
	e[++cnt].v=v;
	e[cnt].w=w;
	e[cnt].next=head[u];
	head[u]=cnt;
}
struct node{
	ll u,d;
	bool operator<(const node&r) const{
		return d>r.d;
	}
};
int main(){
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	scanf("%d%d%d",&n,&m,&q);
	for(int i = 1;i<=n;i++){scanf("%d",&V[i]);}
	for(int i = 1;i<=m;i++){
		int u,v;
		ll w; scanf("%d%d%lld",&u,&v,&w);
		addedge(u,v,w); addedge(v,u,w);
	}
	while(q--){
		int s,c,d;
		memset(vis,0,sizeof(vis));
		memset(dis,0x3f3f3f3f,sizeof(dis));
		scanf("%d%d%d",&s,&c,&d);
		priority_queue<node> q;
		q.push(node{s,0}); dis[s]=0;
		while(!q.empty()){
			int u = q.top().u; q.pop();
			if(vis[u]) continue; vis[u]=1;
			if(V[u]<=c||u==s)
			for(int i = head[u];i;i=e[i].next){
				int v=e[i].v;
				if(dis[v]>dis[u]+e[i].w){
					dis[v]=dis[u]+e[i].w;
					if(!vis[v]){
						q.push(node{v,dis[v]});
					}
				}
			}
		}
		int ans=0;
		for(int i = 1;i<=n;i++)
		if(dis[i]<=d) ans++;
	//	cout<<dis[i]<<" ";
		printf("%d\n",ans-1);
	}
	return 0;
}