#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,m,q;
int p[100],a[100][100];
int s,c,d,ans=0;
bool b[500],e[500];
void  bfs(int x,int dis){
	for(int i=1;i<=n;i++){
		if(a[x][i]>0){
			if(a[x][i]<=dis){
				if(!b[i]){
					b[i]=1;
					ans++;
				}
				if(!e[i]&&p[i]<=c){
					e[i]=1;
					bfs(i,dis-a[x][i]);
				}
			}
		}
	}
	return ;
}
void init(){
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(a[i][j]>a[i][k]+a[k][j])
					a[i][j]=a[i][k]+a[k][j];
			}
		}
	}
}
int main()
{
	freopen("snackstore.in","r",stdin);
	freopen("snackstore.out","w",stdout);
	memset(a,10,sizeof(a));
	memset(b,0,sizeof(b));
	memset(e,0,sizeof(e));
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++){
		scanf("%d",&p[i]);
	}
	for(int i=1;i<=m;i++){
		int x,y,l;
		scanf("%d%d%d",&x,&y,&l);
		a[x][y]=l;
		a[y][x]=l;
	}
	//init();
	for(int i=1;i<=n;i++)a[i][i]=-1;
	/*for(int i=1;i<=n;i++){
		for(int k=1;k<=n;k++){
			cout<<a[i][k]<<' ';
		}
		cout<<endl;
	}*/
	for(int i=1;i<=q;i++){
		ans=0;
		memset(b,0,sizeof(b));
		memset(e,0,sizeof(e));
		scanf("%d%d%d",&s,&c,&d);
		b[s]=1;
		e[s]=1;
		bfs(s,d);
		cout<<ans<<endl;
	}
	return 0;
}