#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
using namespace std;
struct node{int y,next,v;}e[10010*2];
int n,m,q,x,c,s,ans,len,Q[11000],Link[110],v[110],vis[110],dis[110],del[110];
char buf[1<<15],*fs,*ft;
inline char getc() {return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read()
{
	int x=0,f=1;  char ch=getchar();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void insert(int x,int y,int v)  {e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;}
void spfa(int st)
{
	int head=0,tail=1;
	memset(dis,10,sizeof(dis));
	Q[1]=st;  vis[st]=1;  dis[st]=0;
	while(++head<=tail)
	{
		int x=Q[head];
		for(int i=Link[x];i;i=e[i].next)
			if(dis[x]+e[i].v<dis[e[i].y]&&!del[e[i].y])
			{
				dis[e[i].y]=dis[x]+e[i].v;
				if(!vis[e[i].y])
				{
					Q[++tail]=e[i].y;
					vis[e[i].y]=1;
				}
			}
		vis[x]=0;
	}
}
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++)  v[i]=read();
	for(int i=1;i<=m;i++)
	{
		int x=read(),y=read(),v=read();
		insert(x,y,v);  insert(y,x,v);
	}
	for(int i=1;i<=q;i++)
	{
		int x=read(),c=read(),s=read();
		memset(vis,0,sizeof(vis));
		memset(del,0,sizeof(del));
		for(int j=1;j<=n;j++)  if(v[j]>c)  del[j]=1;  
		spfa(x);  ans=0;  del[x]=0;
		for(int j=1;j<=n;j++)  if(!del[j]&&dis[j]<=s&&j!=x)  ans++;
		for(int j=1;j<=n;j++)  
			if(!del[j])
			{
				for(int k=Link[j];k;k=e[k].next)
					if(!vis[e[k].y]&&del[e[k].y]&&e[k].y!=x&&e[k].v+dis[j]<=s)
					{
						vis[e[k].y]=1;
						ans++;
					}
			}
		printf("%d\n",ans);
	}
	return 0;
}