#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,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;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}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){T ans=T(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;}
template<class T> T square(T a){return a * a;}

namespace po167{
    long long rev(long long a,long long mod){
        a%=mod;
        long long ans=1;
        long long H=mod-2;
        while(H){
            if(H&1) ans=(ans*a)%mod;
            a=(a*a)%mod;
            H>>=1;
        }
        return ans;
    }
    long long Determinant_Matrix(std::vector<std::vector<long long>> G,long long MOD){
        int N=G.size();
        long long ans=1;
        for(int i=0;i<N;i++){
            for(int j=i;j<N;j++){
                G[j][i]=(G[j][i]%MOD+MOD)%MOD;
                if(G[j][i]!=0){
                    if(j!=i){
                        for(int k=i;k<N;k++){
                            std::swap(G[i][k],G[j][k]);
                        }
                        ans*=-1;
                    }
                    break;
                }
            }
            if(G[i][i]==0){
                return 0;
            }
            ans=(ans*G[i][i])%MOD;
            long long R=rev(G[i][i],MOD);
            for(int j=i+1;j<N;j++){
                long long D=(R*G[j][i])%MOD;
                for(int k=i;k<N;k++){
                    G[j][k]=(G[j][k]-(D*G[i][k])%MOD+MOD)%MOD;
                }
            }
        }
        return (ans+MOD)%MOD;
    }
//行列木定理
    long long Kirchhoffs_theorem(std::vector<std::vector<long long>> G,long long MOD){
        int N=G.size();
        std::vector<std::vector<long long>> H(N-1,std::vector<long long>(N-1));
        for(int i=0;i<N-1;i++){
            for(int j=0;j<N;j++){
                if(i==j) continue;
                H[i][i]=(H[i][i]+G[i][j])%MOD;
                if(j!=N-1){
                    H[i][j]=(MOD-G[i][j])%MOD;
                }
            }
        }
        return Determinant_Matrix(H,MOD);
    }
}
using po167::Determinant_Matrix;
using po167::Kirchhoffs_theorem;


#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int K;
    cin >> K;
    mint dp0 = 1, dp1 = 0;
    rep(rp, 0, K){
        int N, M;
        cin >> N >> M;
        vector G(N + 2, vector<ll>(N + 2));
        rep(i, 0, M){
            int a, b;
            cin >> a >> b;
            a--, b--;
            G[a][b] = 1;
            G[b][a] = 1;
        }
        G[N][0] = 1;
        G[N + 1][1] = 1;
        G[0][N] = 1;
        G[1][N + 1] = 1;
        auto tmp1 = po167::Kirchhoffs_theorem(G, 998244353);
        G[N][N + 1] = 1;
        G[N + 1][N] = 1;
        auto tmp2 = po167::Kirchhoffs_theorem(G, 998244353);
        mint X = tmp1;
        mint Y = tmp2 - tmp1;
        // cout << X.val() << " " << Y.val() << "\n";
        dp1 *= Y;
        dp1 += dp0 * X;
        dp0 *= Y;
    }
    cout << dp1.val() << "\n";
}