#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<vector<int>> xx(n+1, vector<int>(n+1));
	for (int i=0; i<n+1; i++){
		for (int j=0; j<n+1; j++){
			cin >> xx[i][j];
		}
	}
	vector<vector<mint>> f(n+1, vector<mint>(0));
	for (int i=1; i<n+1; i++){
		f[i].resize(i);
		for (int j=0; j<i; j++){
			f[i][j] = xx[j][i];
		}
	}
	int q; cin >> q;
	for (int num=0; num<q; num++){
		int k; cin >> k;
		vector<vector<pair<int,mint>>> g(n+1, vector<pair<int,mint>>(0));
		for (int j=0; j<k; j++){
			int a, b, c; cin >> a >> b >> c;
			g[b].push_back(pair(a, c));
		}
		vector<mint> dp(n+1);
		dp[0] = 1;
		for (int i=1; i<n+1; i++){
			for (int j=0; j<i; j++){
				dp[i] += f[i][j] * dp[j];
			}
			for (auto [b, c]: g[i]){
				dp[i] += c * dp[b];
			}
		}
		cout << dp[n].val() << endl;
	}
}