#ifdef DEBUG
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

const ll mod = 1000000007;
//const ll mod = 998244353;

#define X first
#define Y second

ll pew(ll a, ll b)
{
    ll res = 1;
    while (b>0)
    {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
    return res;
}

vector<ll> P(7);

vector<vector<ll>> a;

const int K = 10;
int t[10000][K+1][K+1];

void calc(int v, int tl, int tr)
{
    for (int i=0;i<=K;i++)
    {
        for (int j=i;j<=K;j++) t[v][i][j] = 0;
        t[v][i][i] = 1;
    }
    for (int p=tl;p<=tr;p++)
    {
        for (int j=K-1;j>=0;j--)
        {
            for (int st=0;st<=j;st++)
            {
                t[v][st][j+1] = (t[v][st][j+1]+t[v][st][j]*a[p][j])%mod;
            }
        }
    }
}

void recalc(int v)
{
    for (int i=0;i<=K;i++)
    {
        for (int j=i;j<=K;j++)
        {
            t[v][i][j] = 0;
            for (int w=i;w<=j;w++)
            {
                t[v][i][j] = (t[v][i][j]+t[v*2][i][w]*1LL*t[v*2+1][w][j])%mod;
            }
        }
    }
}


void build(int v, int tl, int tr)
{
    if (tr-tl<=20)
    {
        calc(v,tl,tr);
        return;
    }
    int tm = (tl+tr)/2;
    build(v*2,tl,tm);
    build(v*2+1,tm+1,tr);
    recalc(v);
}

void upd(int v, int tl, int tr, int p)
{
    if (tr-tl<=20)
    {
        calc(v,tl,tr);
        return;
    }
    int tm = (tl+tr)/2;
    if (tm>=p) upd(v*2,tl,tm,p);
    else upd(v*2+1,tm+1,tr,p);
    recalc(v);
}

vector<ll> dp(K+1);

void get(int v, int tl, int tr, int l, int r)
{
    if (tl>=l and tr<=r)
    {
        for (int j=K;j>0;j--)
        {
            for (int i=j-1;i>=0;i--) dp[j] = (dp[j]+dp[i]*t[v][i][j])%mod;
        }
        return;
    }
    if (tr-tl<=20)
    {
        l = max(l,tl);
        r = min(r,tr);
        for (int p=l;p<=r;p++)
        {
            for (int j=K-1;j>=0;j--)
            {
                dp[j+1] = (dp[j+1]+dp[j]*a[p][j])%mod;
            }
        }
        return;
    }
    int tm = (tl+tr)/2;
    if (tm>=l) get(v*2,tl,tm,l,r);
    if (tm<r) get(v*2+1,tm+1,tr,l,r);
}

void solve()
{
    int n;
    cin >> n;
    ll S = 0;
    for (int i=0;i<7;i++)
    {
        cin >> P[i];
        S += P[i];
    }
    S = pew(S,mod-2);
    for (int i=0;i<7;i++) P[i] = P[i]*S%mod;
    vector<int> pos = {0,1,2,2,3,4,3,5,2,6};
    string ss = "helloworld";
    a.resize(n,vector<ll>(10));
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<10;j++) a[i][j] = P[pos[j]];
    }
    build(1,0,n-1);
    int q;
    cin >> q;
    while (q--)
    {
        int T;
        cin >> T;
        if (T==1)
        {
            int x;
            char ch;
            cin >> x >> ch;
            x--;
            for (int i=0;i<K;i++)
            {
                if (ch!=ss[i]) a[x][i] = 0;
                else a[x][i] = 1;
            }
            upd(1,0,n-1,x);
            continue;
        }
        int L, R;
        cin >> L >> R;
        L--, R--;
        for (int i=0;i<=K;i++) dp[i] = 0;
        dp[0] = 1;
        get(1,0,n-1,L,R);
        cout << dp[K] << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//#ifdef DEBUG
    //freopen("input.txt", "r", stdin);
//#endif
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}