#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll N;
	cin>>N;
	N++;
	vector X(N,vector<ll>(N));
	rep(i,0,N) rep(j,0,N) cin>>X[i][j];
	vector G(N,vector<ll>(N));
	rep(s,0,N){
		G[s][s]=1;
		rep(t,s,N){
			G[s][t]%=mod;
			G[t][s]=G[s][t];
			rep(k,t+1,N){
				G[s][k]+=(G[s][t]*X[t][k])%mod;
			}
		}
	}
	rep(i,0,N) vec_out(G[i]);
	int Q;
	cin>>Q;
	rep(rp,0,Q){
		ll K;
		cin>>K;
		set<ll> s;
		vector<ll> A(K),B(K),C(K);
		s.insert(0);
		s.insert(N-1);
		rep(i,0,K){
			cin>>A[i]>>B[i]>>C[i];
			s.insert(A[i]);
			s.insert(B[i]);
		}
		int L=s.size();
		vector<vector<ll>> H(L);
		vector<int> p;
		map<int,int> m;
		int ind=0;
		for(auto x:s) m[x]=ind,p.push_back(x),ind++;
		rep(i,0,K){
			H[m[A[i]]].push_back(i);
		}
		vector<ll> dp(L);
		rep(i,0,L){
			dp[i]%=mod;
			for(auto x:H[i]){
				int a=m[B[x]];
				ll tmp=((dp[i]+G[0][p[i]])*C[x])%mod;
				rep(j,a,L){
					dp[j]+=(tmp*G[a][p[j]])%mod;
				}
			}
			//vec_out(dp);
		}
		cout<<(dp[L-1]+G[0][N-1])%mod<<"\n";
	}
}