#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int N = 100005, MOD = 1000000007, M = 500005 << 1;
int n, m[N], msum, tcd[N], size[N], totcd[N];

vector<pair<int, int> > edge[N];

vector<int> l[N], c[N];

int dfs(int u, int fa = -1) {
	int ret = tcd[u];
	size[u] = m[u];
	for (int i = 0; i < (int)edge[u].size(); ++i) {
		int v = edge[u][i].first, w = edge[u][i].second;
		if (v == fa) {
			continue;
		}
		int vd = dfs(v, u);
		size[u] += size[v];
		(ret += (vd + (long long)size[v] * w % MOD) % MOD) %= MOD;
	}
	return ret;
}

void dfs2(int u, int fa = -1) {
	for (int i = 0; i < (int)edge[u].size(); ++i) {
		int v = edge[u][i].first, w = edge[u][i].second;
		if (v == fa) {
			continue;
		}
		totcd[v] = (totcd[u] + (long long)(msum - size[v] * 2) * w) % MOD;
		if (totcd[v] < 0) {
			totcd[v] += MOD;
		}
		dfs2(v, u);
	}
}

int curn, csum[M], cordSum[M];

long long cord[M];

void init(int n, vector<int> &l, vector<int> &c) {
	curn = n;
	cord[0] = 0;
	for (int i = 0; i <= 2 * n; ++i) {
		cord[i + 1] = cord[i] + l[i % n];
	}
	cordSum[0] = 0;
	for (int i = 0; i <= 2 * n; ++i) {
		cordSum[i + 1] = (cordSum[i] + cord[i]) % MOD;
	}
	csum[0] = 0;
	for (int i = 0; i <= 2 * n; ++i) {
		csum[i + 1] = (csum[i] + c[i % n]) % MOD;
	}
}

long long getDis(int l, int r) {
	if (r < l) {
		r += curn;
	}
	return cord[r] - cord[l];
}

int getDisTC(int l, int r) {
	if (r < l) {
		r += curn;
	}
	return (csum[r + 1] - csum[l] + MOD) % MOD;
}

int getDisSum(int l, int r) {
	if (r < l) {
		r += curn;
	}
	int cnt = r - l;
	return ((long long)cord[r] * cnt % MOD - (cordSum[r] - cordSum[l]) % MOD + MOD) % MOD;
}

int getDisSumR(int l, int r) {
	if (r < l) {
		r += curn;
	}
	int cnt = r - l;
	return ((long long)-cord[l] * cnt % MOD + (cordSum[r + 1] - cordSum[l + 1]) % MOD + MOD) % MOD;
}

int solve(int n, vector<int> &l, vector<int> &c) {
	int ret = 0;
	init(n, l, c);
	for (int i = 0; i < n; ++i) {
		int l = 0, r = n - 1;
		while (l < r) {
			int m = (l + r + 1) >> 1, j = (i + n - m) % n;
			long long d1 = getDis(j, i),
				 	  d2 = c[j] + c[i];
			if (d1 < d2) {
				l = m;
			} else {
				r = m - 1;
			}
		}
		int lc = l;
		l = 0, r = n - 1;
		while (l < r) {
			int m = (l + r + 1) >> 1, j = (i + m) % n;
			long long d1 = getDis(i, j),
				 	  d2 = c[i] + c[j];
			if (d1 < d2) {
				l = m;
			} else {
				r = m - 1;
			}
		}
		int rc = l;
		int lu = (i + n - lc) % n, ru = (i + rc) % n;
		int tmp = 0;
		if (lc + rc == n - 1) {
			tmp = (getDisSum(lu, i) + getDisSumR(i, ru)) % MOD;
		} else if (lc + rc < n - 1) {
			tmp = ((long long) c[i] * (n - 1 - lc - rc) +
							getDisTC((ru + 1) % n, (lu + n - 1) % n) +
						  	getDisSum(lu, i) + getDisSumR(i, ru)) % MOD;
		} else {
			l = 0, r = n - 1;
			while (l < r) {
				int m = (l + r + 1) >> 1, j = (i + m) % n;
				long long d1 = getDis(i, j),
					 	  d2 = getDis(j, i);
				if (d1 < d2) {
					l = m;
				} else {
					r = m - 1;
				}
			}
			rc = l, lc = n - 1 - l;
			lu = (i + n - lc) % n, ru = (i + rc) % n;
			tmp = (getDisSum(lu, i) + getDisSumR(i, ru)) % MOD;
		}
		(ret += tmp) %= MOD;
	}
	return ret;
}

int main() { 
	scanf("%d", &n);
	for (int i = 1; i < n; ++i) {
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		--u, --v;
		edge[u].push_back(make_pair(v, w));
		edge[v].push_back(make_pair(u, w));
	}
	msum = 0;
	for (int i = 0; i < n; ++i) {
		scanf("%d", m + i);
		--m[i];
		msum += m[i];
		l[i].resize(m[i]), c[i].resize(m[i]);
		for (int j = 0; j < m[i]; ++j) {
			scanf("%d", &l[i][j]);
		}
		for (int j = 0; j < m[i]; ++j) {
			scanf("%d", &c[i][j]);
		}
		for (int _ = 0; _ < 2 * m[i]; ++_) {
			int cur = _ % m[i], pre = (cur + m[i] - 1) % m[i];
			c[i][cur] = min(c[i][cur], c[i][pre] + l[i][pre]);
		}
		for (int _ = 2 * m[i] - 1; _ >= 0; --_) {
			int cur = _ % m[i], nxt = (cur + 1) % m[i];
			c[i][cur] = min(c[i][cur], c[i][nxt] + l[i][cur]);
		}
		tcd[i] = 0;
		for (int j = 0; j < m[i]; ++j) {
			tcd[i] += c[i][j];
			if (tcd[i] >= MOD) {
				tcd[i] -= MOD;
			}
		}
	}
	totcd[0] = dfs(0);
	dfs2(0);
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		(ans += ((long long)(totcd[i] - tcd[i]) * m[i] + (long long)tcd[i] * (msum - m[i])) % MOD) %= MOD;
		(ans += solve(m[i], l[i], c[i])) %= MOD;
	}
	printf("%d\n", ans);
	return 0;
}