#include <iostream>
#include <cstdio>
#include <vector>
#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 1e3 + 5, S = N * 3, P = 998244353;

int n, f[N][S], sz[N], g[S], inv[S];

vector<PII> e[N];

int c[4];

int inline power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % P;
		a = 1ll * a * a % P;
		b >>= 1;
	}
	return res;
}

void inline add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

void dfs(int u, int fa) {
	sz[u] = 1;
	for (int k = 0; k < e[u].size(); k++) {
		int v = e[u][k].fi, w = e[u][k].se;
		if (v == fa) continue;
		dfs(v, u);
		for (int i = 1; i <= sz[u] * 3; i++) {
			for (int j = 1; j <= sz[v] * 3; j++) {
				int s = 1ll * f[u][i] * f[v][j] % P;
				if (w) add(g[i + j], s);
				else add(g[i + j], P - s), add(g[i], s);
			}
		}
		sz[u] += sz[v];
		for (int i = 1; i <= sz[u] * 3; i++) 
			f[u][i] = g[i], g[i] = 0;
	}
	for (int i = 1; i <= sz[u] * 3; i++)
		f[u][i] = 1ll * f[u][i] * inv[i] % P;
}

int main() {
	scanf("%d", &n);
	inv[1] = 1;
	for (int i = 2; i <= 3 * n; i++)
		inv[i] = ((LL)P - P / i) * inv[P % i] % P;
	for (int i = 1; i <= n; i++) {
		int s = 0;
		for (int j = 1; j <= 3; j++) scanf("%d", c + j), add(s, c[j]);
		s = power(s, P - 2);
		for (int j = 1; j <= 3; j++) f[i][j] = 1ll * c[j] * s % P * j % P;
	}
	for (int i = 1, u, v; i < n; i++)
		scanf("%d%d", &u, &v), e[u].pb(mp(v, 1)), e[v].pb(mp(u, 0));
	dfs(1, 0);
	int ans = 0;
	for (int i = 1; i <= sz[1] * 3; i++)
		add(ans, f[1][i]);
	printf("%d\n", ans);
	return 0;
}