#include <iostream>
#include <cstring>
using namespace std;
constexpr const int mod = 1000000007;
constexpr int OFR(const int val)
{
	return val >= mod ? val - mod : val;
}
constexpr int UFR(const int val)
{
	return val < 0 ? val + mod : val;
}
constexpr void UpdMin(int &a, const int b)
{
	if (a > b)
		a = b;
	return;
}
char buf[16777216], *p_in = buf;
int ReadU()
{
	while (*p_in < '0')
		++p_in;
	int ans = *p_in ^ '0';
	while (*(++p_in) >= '0')
		ans = ans * 10 + (*p_in ^ '0');
	return ans;
}
int siz_edge, sum_m, ans1, edges[100001], m[100001], sum_dis[100001], l[1000001], c[1000001], sum_c[1000001], f[500005], tag[1000001];
long long sum_l[1000001];
struct Edge
{
	int dest, next, t;
} edge[200002];
void Link(const int source, const int dest, const int t)
{
	edge[++siz_edge].next = edges[source];
	edge[edges[source] = siz_edge].dest = dest;
	edge[siz_edge].t = t;
	return;
}
void DFS(const int pos, const int parent)
{
	ans1 = (ans1 + 1ull * (sum_m - m[pos]) * sum_dis[pos]) % mod;
	for (int i = edges[pos]; i; i = edge[i].next)
		if (edge[i].dest != parent)
		{
			DFS(edge[i].dest, pos);
			ans1 = (ans1 + 1ull * m[edge[i].dest] * (sum_m - m[edge[i].dest]) % mod * edge[i].t) % mod;
			m[pos] += m[edge[i].dest];
		}
	return;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin.read(buf, sizeof(buf));
	const int n = ReadU();
	for (int i = 1; i < n; ++i)
	{
		const int u = ReadU(), v = ReadU(), t = ReadU();
		Link(u, v, t);
		Link(v, u, t);
	}
	int ans2 = 0;
	for (int i = 1; i <= n; ++i)
	{
		const int m = ::m[i] = ReadU() - 1, m2 = m * 2;
		sum_m += m;
		for (int j = 1; j <= m; ++j)
			l[j + m] = l[j] = ReadU();
		for (int j = 1; j <= m; ++j)
			c[j + m] = c[j] = ReadU();
		for (int j = 1; j < m2; ++j)
			UpdMin(c[j + 1], c[j] + l[j]);
		for (int j = m2 - 1; j; --j)
			UpdMin(c[j], c[j + 1] + l[j]);
		unsigned long long sd = 0;
		for (int j = 1; j <= m; ++j)
		{
			UpdMin(c[j], c[j + m]);
			sd += c[j + m] = c[j];
		}
		sum_dis[i] = sd % mod;
		for (int j = 1; j < m2; ++j)
		{
			sum_c[j] = OFR(sum_c[j - 1] + c[j]);
			sum_l[j + 1] = sum_l[j] + l[j];
		}
		sum_c[m2] = OFR(sum_c[m2 - 1] + c[m2]);
		int p = 1;
		for (int j = 1; j <= m; ++j)
		{
			const int jPm = j + m;
			while (sum_l[p] - sum_l[j] < c[j] + c[p] && sum_l[p] - sum_l[j] <= sum_l[jPm] - sum_l[p])
				++p;
			tag[j] += (f[j] = p - 1) - j;
			tag[j + 1] -= p - j;
			++tag[p];
		}
		for (int j = 1, a = 0, b = 0; j <= p; ++j)
		{
			b += a += tag[j];
			tag[j] = 0;
			ans1 = (ans1 + 1ull * b * l[j]) % mod;
		}
		p = m2 - 1;
		for (int j = m; j; --j)
		{
			const int jPm = j + m;
			while (sum_l[jPm] - sum_l[p] < c[jPm] + c[p] && sum_l[jPm] - sum_l[p] < sum_l[p] - sum_l[j])
				--p;
			ans2 = (ans2 + 1ull * (p - f[j]) * c[j] + (sum_c[p] + mod - sum_c[f[j]])) % mod;
		}
	}
	DFS(1, 0);
	cout << OFR(OFR(ans1 * 2) + ans2);
	return 0;
}