杭电 4284

#include<stdio.h>  //最短数+暴收
#include<string.h>
#define INF 10000000
#define N 110
int n,flag,h;
int a[N],d[N],c[N],map[N][N];
bool vis[N];
void dfs(int cur,int num,int coin)
{
	int i;
	if(flag)return ;
	if(num==h)
	{
		if(coin-map[cur][1]>=0)
		{
			flag=1;
			
		}
		return ;
	}
	
	for(i=0;i<h;i++)
	{
		int v=a[i];
		if((coin-map[cur][v])>=0 && (coin-map[cur][v]-d[i]>=0) && !vis[v])
		{
			int	res=coin-map[cur][v]-d[i]+c[i];
			vis[v]=1;               
			if(res>=0)
				dfs(v,num+1,res);
			vis[v]=0;    
		}                
	}
}
int main()
{
	int t,n,m,totle,i,j,k,ci,di,u,v,cost;
	
	scanf("%d",&t);
	
	while(t--)
	{
        scanf("%d%d%d",&n,&m,&totle); 
        memset(vis,0,sizeof(vis));
        for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				map[i][j]=INF;
				if(i==j)
					map[i][j]=0;
			}
			
			for(i=0;i<m;i++)
			{     
				scanf("%d%d%d",&u,&v,&cost);
				//printf("+++%d %d %d+++\n",u,v,cost);
				if(map[u][v]>cost)
					map[u][v]=map[v][u]=cost;
			}
			for(i=1;i<=n;i++)
				for(j=1;j<=n;j++)
					for(k=1;k<=n;k++)
					{
						if(map[j][i]+map[i][k]<map[j][k])
							map[j][k]=map[j][i]+map[i][k];
					}
					
					
					scanf("%d",&h);
					//printf("%d\n",h);
					for(i=0;i<h;i++)
					{
						scanf("%d%d%d",&k,&ci,&di);
						a[i]=k;
						c[i]=ci;
						d[i]=di;          
					}
					flag=0;
					dfs(1,0,totle);
					if(flag)
						printf("YES\n");
					else
						printf("NO\n");
					
	}		
	return 0;
}