#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200005,M = 1000000007;
int t,n,a[N],b[N],c[N],low[N],dfn[N],id[N],cnt,col,p[N],sz[N],in[N],ans[N];
bool isn[N];
vector<int>vec[N],tec[N];
stack<int>s;
void Tarjan(int u)
{
	dfn[u] = low[u] = ++cnt;
	isn[u] = 1;
	s.push(u);
	for (int i: vec[u])
	{
		if (!dfn[i])
		{
			Tarjan(i);
			low[u] = min(low[u],low[i]);
		}
		else if (isn[i])
			low[u] = min(low[u],dfn[i]);
	}
	if (dfn[u] == low[u])
	{
		int x;
		col++;
		do
		{
			x = s.top();
			s.pop();
			isn[x] = 0;
			id[x] = col;
		} while (x != u);
	}
}
queue<int>q;
void toposort()
{
	while (!q.empty())
	{
		int now = q.front();
		q.pop();
		bool t = 0;
		if (ans[now] && p[now] > sz[now]) ans[now] = -1;
		for (int i: tec[now])
		{
			in[i]--;
			if (!in[i]) q.push(i);
			if (ans[i] == -1 || !ans[now]) continue;
			if (ans[now] == -1 || p[now] >= sz[now]) ans[i] = -1;
			else ans[i] = (ans[i]+ans[now])%M+M;
		}
	}
}
signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> t;
	for (int k = 1; k <= t; k++)
	{
		cin >> n;
		for (int i = 1; i <= n; i++)
			vec[i].clear(),tec[i].clear(),dfn[i] = low[i] = ans[i] = p[i] = sz[i] = in[i] = isn[i] = 0;
		cnt = col = 0;
		for (int i = 1; i <= n; i++)
			cin >> a[i] >> b[i],
			vec[i].push_back(a[i]),vec[i].push_back(b[i]);
		for (int i = 1; i <= n; i++)
			if (!dfn[i])
				Tarjan(i);
		for (int i = 1; i <= n; i++)
		{
			sz[id[i]]++;
			if (id[a[i]] == id[i]) p[id[i]]++;
			else tec[id[i]].push_back(id[a[i]]),in[id[a[i]]]++;
			if (id[b[i]] == id[i]) p[id[i]]++;
			else tec[id[i]].push_back(id[b[i]]),in[id[b[i]]]++;
		}
		for (int i = 1; i <= n; i++)
			cin >> c[i],ans[id[i]] += c[i];
		for (int i = 1; i <= col; i++)
			if (!in[i]) q.push(i);
		toposort();
		if (ans[id[1]] == -1) cout << "Case #" << k << ": UNBOUNDED\n";
		else cout << "Case #" << k << ": " << ans[id[1]]%M << '\n';
	}
	return 0;
}