#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>

using namespace std;

struct conduit
{
	int x1,y1,x2,y2,id,h;
	conduit *to[50];
	int smally[50],num;
	bool yyy;
	void add(conduit &a,int y)
	{
		num++;
		int j=num;
		while (j>1 && y>smally[j-1]) 
		{	
			to[j]=to[j-1];
			smally[j]=smally[j-1];
			j--;
		}
		smally[j]=y;
		to[j]=&a;
	}
}con[30];

int p,g,Tim,w,wy;

void init()
{
	memset(con,0,sizeof(con));
	scanf("%d",&p);
	for (int i=1;i<=p;i++)
	{
		con[i].id=i;
		scanf("%d%d%d",&con[i].x1,&con[i].y1,&con[i].h);
		con[i].x2=con[i].x1+1;
		con[i].y2=con[i].y1+con[i].h;
	}
	scanf("%d",&g);
	int x,y,lo,to1,to2;
	for (int i=1;i<=g;i++)
	{
		scanf("%d%d%d",&x,&y,&lo);
		for (int j=1;j<=p;j++)
		{
			if (x==con[j].x2 && y>=con[j].y1 && y<=con[j].y2)
				to1=j;
			if (x+lo==con[j].x1 && y>=con[j].y1 && y<=con[j].y2)
				to2=j;
		}
		con[to1].add(con[to2],y);
		con[to2].add(con[to1],y);
	}
	scanf("%d%d",&w,&wy);
	Tim=0;
}


bool guan(conduit *now,int y1,conduit *come)
{
	now->yyy=true;
	if (y1<now->y1) return true;
	int i;
	for (i=1;i<=now->num;i++)
	if (!now->to[i]->yyy && now->smally[i]>=y1)
	{
		if (guan(now->to[i],y1,now)) return true;
	}
	Tim+=now->y2-y1;
	return false;
}

void solve()
{
	conduit *en=&con[w];
	conduit *start=&con[1];
	if (guan(start,wy,NULL)) printf("No Solution\n");
	else if(!en->yyy) printf("No Solution\n");
	else printf("%d\n",Tim);
}

int main()
{
	freopen("spider.in","r",stdin);
	freopen("spider.out","w",stdout);
	int T;
	scanf("%d",&T);
	for (int i=1;i<=T;i++)
	{
		init();
		solve();
	}
	return 0;
}