#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector x(n + 1, vector<mint>(n + 1));
	rep(i, n + 1)rep(j, n + 1) {
		int _x; cin >> _x;
		x[i][j] = _x;
	}
	vector dp(n + 1, vector<mint>(n + 1));
	rep(i, n + 1) {
		dp[i][i] = 1;
		rep2(j, i, n + 1)rep2(k, j + 1, n + 1) dp[i][k] += dp[i][j] * x[j][k];
	}
	int q; cin >> q;
	while (q--) {
		int k; cin >> k;
		/*vector a(k, vector<int>(3));
		rep(i, k) rep(j, 3)cin >> a[i][j];
		sort(all(a));
		int st = 0;
		int ed = k * 2 + 1;
		int sz = ed + 1;
		vector nx(sz, vector<mint>(sz));
		nx[st][ed] = dp[0][n];
		rep(i, k) {
			nx[st][i * 2 + 1] += dp[0][a[i][0]];
			nx[i * 2 + 1][i * 2 + 2] += a[i][2];
			nx[i * 2 + 2][ed] += dp[a[i][1]][n];
		}
		rep(i, k)rep(j, k) nx[i * 2 + 2][j * 2 + 1] += dp[a[i][1]][a[j][0]];
		vector<mint>ans(sz);
		ans[0] = 1;
		rep(i, sz) rep(j, sz) ans[j] += ans[i] * nx[i][j];
		cout << ans.back().val() << endl;*/
		vector<int>a(k), b(k), c(k);
		vector<int>v;
		rep(i, k) {
			cin >> a[i] >> b[i] >> c[i];
			v.push_back(a[i]);
			v.push_back(b[i]);
		}
		sort(all(v));
		v.erase(unique(all(v)), v.end());
		int st = 0;
		int ed = v.size() + 1;
		int sz = ed + 1;
		vector nx(sz, vector<mint>(sz));
		nx[st][ed] = dp[0][n];
		rep(i, k)rep(j, k) {
			if (!(b[i] < a[j]))continue;
			int idx0, idx1;
			rep(_k, v.size()) {
				if (b[i] == v[_k])idx0 = _k + 1;
				if (a[j] == v[_k])idx1 = _k + 1;
			}
			nx[idx0][idx1] += dp[b[i]][a[j]];
		}
		rep(i, k) {
			int idx0, idx1;
			rep(j, v.size()) {
				if (a[i] == v[j])idx0 = j + 1;
				if (b[i] == v[j])idx1 = j + 1;
			}
			nx[st][idx0] = dp[0][a[i]];
			nx[idx0][idx1] += c[i];
			nx[idx1][ed] = dp[b[i]][n];
		}
		vector<mint>ans(sz);
		ans[0] = 1;
		rep(i, sz) rep(j, sz) ans[j] += ans[i] * nx[i][j];
		cout << ans.back().val() << endl;
	}
	return 0;
}