#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
struct edge{
	int from,to,cost;
};
struct vertix{
	int dis,id;
	bool operator < (const vertix& c) const{
		return dis>c.dis;
	}
};
vector<edge> edges;
vector<int> G[101];
priority_queue<vertix> Q;
int dis[101],vis[101],C[101];
int n,m,q;
int dijkstra(int,int,int);
edge make_edge(int,int,int);
vertix make_vertix(int,int);
void add_edge(int,int,int);
int main(){
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	scanf("%d%d%d",&n,&m,&q);
	edges.clear();
	for(int i=1;i<=n;i++) G[i].clear();
	for(int i=1;i<=n;i++) scanf("%d",&C[i]);
	for(int i=1;i<=m;i++){
		int x,y,l;
		scanf("%d%d%d",&x,&y,&l);
		add_edge(x,y,l);
	}
	for(int i=1;i<=q;i++){
		int s,c,d;
		scanf("%d%d%d",&s,&c,&d);
		printf("%d\n",dijkstra(s,c,d));
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
edge make_edge(int u,int v,int w){
	edge temp;
	temp.from=u;
	temp.to=v;
	temp.cost=w;
	return temp;
}
vertix make_vertix(int id,int dis){
	vertix temp;
	temp.dis=dis;
	temp.id=id;
	return temp;
}
void add_edge(int u,int v,int w){
	edges.push_back(make_edge(u,v,w));
	G[u].push_back(edges.size()-1);
	edges.push_back(make_edge(v,u,w));
	G[v].push_back(edges.size()-1);
	return;
}
int dijkstra(int s,int c,int d){
	int ans=0;
	memset(dis,0x3f,sizeof(dis));
	memset(vis,0,sizeof(vis));
	dis[s]=0;
	Q.push(make_vertix(s,0));
	while(!Q.empty()){
		int p=Q.top().id;
		Q.pop();
		if(vis[p]) continue;
		else vis[p]=1;
		for(int i=0;i<G[p].size();i++){
			edge e=edges[G[p][i]];
			if(dis[e.to]>dis[p]+e.cost){
				dis[e.to]=dis[p]+e.cost;
				if(dis[e.to]<=d) ans++;
				if(dis[e.to]<=d&&C[e.to]<=c) Q.push(make_vertix(e.to,dis[e.to]));
			}
		}
	}
	return ans;
}