#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    ll N; cin >> N;
    vector<vector<mint>> X(N+1, vector<mint>(N+1, 0));
    rep (i, N+1) {
        rep (j, N+1) {
            ll x; cin >> x;
            X[i][j] = (mint)x;
        }
    }

    vector<vector<mint>> dp(N+1, vector<mint>(N+1, 0));
    rep (i, N+1) {
        dp[i][i] = 1;
        rep2 (j, 1, N+1) {
            rep (k, j) {
                dp[i][j] += dp[i][k]*X[k][j];
            }
        }
    }

    ll Q; cin >> Q;
    while (Q--) {
        ll K; cin >> K;
        vector<tuple<ll, ll, ll>> edge(K);
        rep (i, K) {
            ll A, B, C; cin >> A >> B >> C;
            edge[i] = {B, A, C};
        }
        sort(all(edge));
        
        auto ep = dp[0];
        for (auto [B, A, C] : edge) {
            mint c = (mint)C;
            ep[B] += ep[A]*c;
            rep2 (i, B+1, N+1) {
                ep[i] += ep[A]*c*dp[B][i];
            }
        }

        print(ep[N].val());
    }
}