#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=20010;
int n,m,q;
int vv[110]={0},ed=0;
int vis[110];
int x,y,l,s,c,d;
struct edge
{
	int next,to,val;
	edge(){next=0;}
}e[maxn];
int head[110];

inline int read()
{
	int x=0;
	char c=getchar();
	while(c<'0'||c>'9')
		c=getchar();
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return x;
}

inline void add(int u,int v,int w)
{
	e[++ed].next=head[u],head[u]=ed,e[ed].to=v,e[ed].val=w;
}

inline void add_edge(int u,int v,int w)
{
	add(u,v,w);
	add(v,u,w);
}

inline int dfs(int start,int worth)
{
	vis[start]=1;
	int gg=0;
	for(int i=head[start];i;i=e[i].next)
	{
		if(!vis[e[i].to]&&worth+e[i].val<=d)
			gg++;
		if(vv[e[i].to]<=c)
			gg+=dfs(e[i].to,worth+e[i].val);
	}
	return gg;
}

int main()
{
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	n=read(),m=read(),q=read();
	for(int i=1;i<=n;i++)
		vv[i]=read();
	for(int i=1;i<=m;i++)
	{
		x=read(),y=read(),l=read();
		add_edge(x,y,l);
	}
	for(int i=1;i<=q;i++)
	{
		s=read(),c=read(),d=read();
		memset(vis,0,sizeof(vis));
		cout<<dfs(s,0)<<endl;
	}
	return 0;
}