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

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x; 
}

#define N 100007
#define fr first
#define sc second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define min(x, y) ((x) < (y) ? (x) : (y))

int lg2[N], l[N][17], r[N][17], a[N], b[N];

vector<pii> s;

#define mod 998244353
#define ls (rt << 1)
#define rs (rt << 1 | 1)
#define mid ((l + r) >> 1)

int n, m, tot, c[N << 2], tag[N << 2];

inline void pushdown(int rt) {
    if (tag[rt] != 1) {
        c[ls] = 1ll * c[ls] * tag[rt] % mod;
        c[rs] = 1ll * c[rs] * tag[rt] % mod;
        tag[ls] = 1ll * tag[ls] * tag[rt] % mod;
        tag[rs] = 1ll * tag[rs] * tag[rt] % mod;
        tag[rt] = 1;
    }
}

inline int mo(int x) {return x >= mod ? x - mod : x;}

inline void pushup(int rt) {
    c[rt] = mo(c[ls] + c[rs]);
}

void build(int rt, int l, int r) {
    c[rt] = 0; tag[rt] = 1;
    if (l == r) return;
    build(ls, l, mid);
    build(rs, mid + 1, r);
}

void add(int rt, int l, int r, int p, int x) {
    if (l == r) {c[rt] = mo(c[rt] + x); return;}
    pushdown(rt);
    p <= mid ? add(ls, l, mid, p, x) : add(rs, mid + 1, r, p, x); 
    pushup(rt);
}

void mul(int rt, int l, int r, int L, int R) {
    if (L <= l && r <= R) {
        tag[rt] = mo(tag[rt] + tag[rt]);
        c[rt] = mo(c[rt] + c[rt]); return;
    }
    pushdown(rt);
    if (L <= mid) mul(ls, l, mid, L, R);
    if (R > mid) mul(rs, mid + 1, r, L, R);
    pushup(rt);
}

int sum(int rt, int l, int r, int L, int R) {
    if (L <= l && r <= R) return c[rt];
    pushdown(rt);
    int ans = 0;
    if (L <= mid) ans = mo(ans + sum(ls, l, mid, L, R));
    if (R > mid) ans = mo(ans + sum(rs, mid + 1, r, L, R));
    return ans;
}

inline void work() {
    s.clear();
    n = rd(); m = rd();
    int t = lg2[n];
    build(1, 0, n);
    for (int i = 1; i <= n; ++i) {
        c[i] = 0;
        for (int j = 0; j <= t; ++j) l[i][j] = r[i][j] = -2e9;
    }
    for (int i = 1; i <= n; ++i) a[i] = rd(), b[i] = rd();
    for (int i = 2; i <= n; ++i) l[i][0] = a[i] - b[i - 1]; 
    for (int i = 1; i < n; ++i) r[i][0] = a[i] - b[i + 1];
    for (int j = 1; j <= t; ++j) {
        for (int i = (1 << j) + 1; i <= n; ++i)
            l[i][j] = min(l[i][j - 1], l[i - (1 << (j - 1))][j - 1]);
        for (int i = 1; i + (1 << j) <= n; ++i)
            r[i][j] = min(r[i][j - 1], r[i + (1 << (j - 1))][j - 1]);
    }
    for (int i = 1; i <= m; ++i) {
        int p = rd(), lw = rd(), rw = rd();
        int L = p, R = p;
        for (int j = t; ~j; --j) {
            if (lw <= l[L][j]) L -= (1 << j);
            if (rw <= r[R][j]) R += (1 << j);
        }
        s.pb(mp(L, R));
    }
    sort(s.begin(), s.end(), [&](pii a, pii b){return a.sc < b.sc;});
    add(1, 0, n, 0, 1);
    for (auto i : s) {
        int L = i.fr, R = i.sc;
        if (L > 1) mul(1, 0, n, 0, L - 2);
        int w = sum(1, 0, n, L - 1, R);
        add(1, 0, n, R, w);
    }
    printf("%d\n", sum(1, 0, n, n, n));
}

int main() {
    for (int i = 1; (1 << i) < N; ++i) ++lg2[1 << i];
    for (int i = 1; i < N; ++i) lg2[i] += lg2[i - 1];
    for (int t = rd(); t; --t) work();
    return 0;
}