#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5, P = 998244353;
using i64 = long long;
using Poly = vector<int>;
/*---------------------------------------------------------------------------*/
#define MUL(a, b) (i64(a) * (b) % P)
#define ADD(a, b) (((a) += (b)) >= P ? (a) -= P : 0) // (a += b) %= P
#define SUB(a, b) (((a) -= (b)) < 0 ? (a) += P : 0)  // ((a -= b) += P) %= P
int POW(i64 a, int b = P - 2, i64 x = 1)
{
    for (; b; b >>= 1, a = a * a % P)
        if (b & 1)
            x = x * a % P;
    return x;
}
namespace NTT
{
    const int g = 3;
    Poly Omega(int L)
    {
        int wn = POW(g, P / L);
        Poly w(L);
        w[L >> 1] = 1;
        for (int i = L / 2 + 1; i < L; i++)
            w[i] = MUL(w[i - 1], wn);
        for (int i = L / 2 - 1; i >= 1; i--)
            w[i] = w[i << 1];
        return w;
    }
    auto W = Omega(1 << 20); // Length
    void DIF(int *a, int n)
    {
        for (int k = n >> 1; k; k >>= 1)
            for (int i = 0, y; i < n; i += k << 1)
                for (int j = 0; j < k; ++j)
                    y = a[i + j + k], a[i + j + k] = MUL(a[i + j] - y + P, W[k + j]), ADD(a[i + j], y);
    }
    void IDIT(int *a, int n)
    {
        for (int k = 1; k < n; k <<= 1)
            for (int i = 0, x, y; i < n; i += k << 1)
                for (int j = 0; j < k; ++j)
                    x = a[i + j], y = MUL(a[i + j + k], W[k + j]),
                    a[i + j + k] = x - y < 0 ? x - y + P : x - y, ADD(a[i + j], y);
        int Inv = P - (P - 1) / n;
        for (int i = 0; i < n; i++)
            a[i] = MUL(a[i], Inv);
        reverse(a + 1, a + n);
    }
}
/*---------------------------------------------------------------------------*/
namespace Polynomial
{
    // basic operator
    int norm(int n) { return 1 << (__lg(n - 1) + 1); }
    void norm(Poly &a)
    {
        if (!a.empty())
            a.resize(norm(a.size()), 0);
        else
            a = {0};
    }
    void DFT(Poly &a) { NTT::DIF(a.data(), a.size()); }
    void IDFT(Poly &a) { NTT::IDIT(a.data(), a.size()); }
    Poly &dot(Poly &a, Poly &b)
    {
        for (int i = 0; i < a.size(); i++)
            a[i] = MUL(a[i], b[i]);
        return a;
    }

    // mul / div int
    Poly &operator*=(Poly &a, int b)
    {
        for (auto &x : a)
            x = MUL(x, b);
        return a;
    }
    Poly operator*(Poly a, int b) { return a *= b; }
    Poly operator*(int a, Poly b) { return b * a; }
    Poly &operator/=(Poly &a, int b) { return a *= POW(b); }
    Poly operator/(Poly a, int b) { return a /= b; }

    // Poly add / sub
    Poly &operator+=(Poly &a, Poly b)
    {
        a.resize(max(a.size(), b.size()));
        for (int i = 0; i < b.size(); i++)
            ADD(a[i], b[i]);
        return a;
    }
    Poly operator+(Poly a, Poly b) { return a += b; }
    Poly &operator-=(Poly &a, Poly b)
    {
        a.resize(max(a.size(), b.size()));
        for (int i = 0; i < b.size(); i++)
            SUB(a[i], b[i]);
        return a;
    }
    Poly operator-(Poly a, Poly b) { return a -= b; }

    // Poly mul
    Poly operator*(Poly a, Poly b)
    {
        int n = a.size() + b.size() - 1, L = norm(n);
        if (a.size() <= 8 || b.size() <= 8)
        {
            Poly c(n);
            for (int i = 0; i < a.size(); i++)
                for (int j = 0; j < b.size(); j++)
                    c[i + j] = (c[i + j] + (i64)a[i] * b[j]) % P;
            return c;
        }
        a.resize(L), b.resize(L);
        DFT(a), DFT(b), dot(a, b), IDFT(a);
        return a.resize(n), a;
    }
}
using namespace Polynomial;

const int inv100 = POW(100);
void solve()
{
    int n;
    cin >> n;
    Poly p(n), c(n), w(n), sumw(n);
    for (int i = 0; i < n; i++)
        cin >> p[i] >> c[i], p[i] = (i64)p[i] * inv100 % P;
    for (int i = 1; i < n; i++)
        cin >> w[i];
    for (int i = 1; i < n; i++)
        sumw[i] = sumw[i - 1] + w[i];
    Poly pre(n);
    for (int i = 0; i < n; i++)
        pre[i] = (i64)(P + 1 - p[i]) * POW(sumw[i]) % P * POW(p[i]) % P;
    Poly a(n + 1), b(n + 1);
    a[0] = 1;
    auto work = [&](auto &work, int l, int r) -> void
    {
        if (l == r)
        {
            if (!l)
                return;
            a[l] = (a[l] + (i64)a[l - 1] * POW(p[l - 1]) % P) % P;
            b[l] = (b[l] + (i64)(P + b[l - 1] - c[l - 1]) * POW(p[l - 1]) % P) % P;
            return;
        }
        int mid = l + r >> 1;
        work(work, l, mid);

        Poly f = {a.begin() + l, a.begin() + mid + 1};
        Poly g = {w.begin(), w.begin() + r - l + 1};
        Poly res = f * g;
        for (int i = mid + 1; i <= r; i++)
            a[i] = (a[i] + P - (i64)res[i - l - 1] * pre[i - 1] % P) % P;

        f = {b.begin() + l, b.begin() + mid + 1};
        res = f * g;
        for (int i = mid + 1; i <= r; i++)
            b[i] = (b[i] + P - (i64)res[i - l - 1] * pre[i - 1] % P) % P;

        work(work, mid + 1, r);
    };
    work(work, 0, n);
    int ans = (i64)(P - b[n]) * POW(a[n]) % P;
    cout << ans << '\n';
}

signed main()

{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}