// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,a,b,now;

struct node{
	int op,u,v,w;
};
vector<node>es;
modint res;

vi as;
void adda(int d){
	as.pb(d);
	sort(as.begin(),as.end(),greater<int>());
	vi o=as,o2;
	int n=::n,res=0;
	int sub=0;
	while(o.size()){
		int d=o.back(); o.pop_back();
//		cout<<"d: "<<d<<"\n";
		if(d==0) continue;
		if(d*2<=n){
			while(o.size() && o.back()*2<=n){
				d=__gcd(d,o.back());
				o.pop_back();
			}
		}
		if(d*2>n){
			o2.pb(d+sub);
			res+=n-(n-d)*2;
			n-=d;
			sub+=d;
			for(auto &x:o) x-=d;
			continue;
		}
		o2.pb(d+sub);
		int t=n/d-1;
		if(o.size()) t=min(t,o.back()/d);
//		cout<<"t: "<<t<<" "<<n/d-1<<"\n";
		n-=t*d;
		sub+=t*d;
		for(auto &x:o) x-=t*d;
		o.pb(d);
		sort(o.begin(),o.end(),greater<int>());
	}
	res+=n;
	::now=res;
	as=o2;
	assert(o2.size()<=200);
}

void addb(int u,int v){
	
}

signed main()
{
	n=read(),a=read(),b=read();
	now=n;
	For(i,1,a){
		int u,v,w,op=1;
		u=read(),w=read(),es.pb({1,u,-1,w});
	}
	For(i,1,b){
		int u,v,w,op=2;
		u=read(),v=read(),w=read(),es.pb({2,u,v,w});
	}
	sort(es.begin(),es.end(),[&](node a,node b){
		return a.w<b.w;
	});
	for(auto [op,u,v,w]:es){
		int lst=now;
		if(op==1) adda(u);
		else addb(u,v);
		res+=((lst-now)%mod)*(w%mod)%mod;
	}
	cout<<res.x;
	return 0;
}
/*
13 4 0
6 19
8 18
9 17
11 16
*/