#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

template<typename T>
class Compress{
    public:
    vector<T> data;
    int offset;
    Compress(vector<T> data_, int offset=0): offset(offset){
        data = data_;
        sort(begin(data), end(data));
        data.erase(unique(begin(data), end(data)), end(data));
    };
    int operator[](T x) {
        auto p = lower_bound(data.begin(), data.end(), x);
        assert(x == *p);
        return offset+(p-data.begin());
	}
    T inv(int x){
        return data[x-offset];
    }
    int size(){
        return data.size();
    }
};

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    auto x = vec2d(n+1, n+1, mint(0));
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++){
            int y; cin >> y;
            x[i][j] = y;
        }
    }
    auto dp = vec2d(n+1, n+1, mint(0));
    for(int s = n; s >= 0; s--){
        for(int t = s+1; t <= n; t++){
            for(int c = s+1; c < t; c++){
                dp[s][t] += x[s][c]*dp[c][t];
            }
            dp[s][t] += x[s][t];
        }
    }
    int q; cin >> q;
    while(q--){
        int k; cin >> k;
        vector<int> v = {0, n};
        vector<int> a(k), b(k), c(k);
        for(int i = 0; i < k; i++){
            cin >> a[i] >> b[i] >> c[i];
            v.push_back(a[i]);
            v.push_back(b[i]);
        }
        auto cp = Compress<int>(v);
        int m = cp.size();
        auto xx = vec2d(m, m, mint(0));
        auto yy = vec2d(m, m, mint(0));
        for(int i = 0; i < m; i++){
            int s = cp.data[i];
            for(int j = 0; j < m; j++){
                int t = cp.data[j];
                xx[i][j] = dp[s][t];
            }
        }
        for(int i = 0; i < k; i++){
            int s = cp[a[i]];
            int t = cp[b[i]];
            yy[s][t] += c[i];
        }
        // cout << "=====" << endl;
        // for(int i = 0; i < m; i++) print_vector(xx[i]);
        // cout << "=====" << endl;
        // for(int i = 0; i < m; i++) print_vector(yy[i]);
        // print_vector(v);
        auto dp = vec2d(m, 2, mint(0));
        dp[0][1] = 1;
        for(int i = 0; i < m; i++){
            for(int j = 0; j < m; j++){
                // 元の道
                dp[j][0] += dp[i][1]*xx[i][j];
                // 新たな道
                dp[j][1] += dp[i][0]*yy[i][j];
                dp[j][1] += dp[i][1]*yy[i][j];
            }
            // print_vector(dp[i]);
        }
        cout << dp[m-1][0]+dp[m-1][1] << endl;
    }
}