#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<tuple>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using std::min;
using std::max;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const ll mod=998244353;
const int NV=2e5;
ll N;

namespace xm{
    struct UFS{
        int f[NV+5];
        void init(int n){
            for(int i=0;i<=n;++i) f[i]=i;
        }int fd(int x){
            return x==f[x]?x:f[x]=fd(f[x]);
        }void un(int x,int y){
            f[fd(x)]=fd(y);
        }
    } ufs[18];
    void un(int x,int y,int d,const int w,ll&ans){
        if(d==0){
            if(ufs[d].fd(x)!=ufs[d].fd(y)){
                ans=(ans+w)%mod;
                ufs[d].un(x,y);
            }
            return;
        }
        if(ufs[d].fd(x)==ufs[d].fd(y)) return;
        ufs[d].un(x,y);
        un(x,y,d-1,w,ans);
        if(y+(1<<d-1)<=N) un(x+(1<<d-1),y+(1<<d-1),d-1,w,ans);
    }void _(){
        int A,B;

        scanf("%lld%d%d",&N,&A,&B);
        if(N<=200000){
            std::vector<std::tuple<int,int,int> > vc;
            for(int i=0;i<18;++i) ufs[i].init(N);
            while(A--){
                int d,x;
                scanf("%d%d",&d,&x);
                vc.emplace_back(x,d,0);
            }
            while(B--){
                int u,v,w;
                scanf("%d%d%d",&u,&v,&w);
                ++u;
                ++v;
                vc.emplace_back(w,u,v);
            }
            ll ans=0;
            std::sort(vc.begin(),vc.end());
            for(auto e:vc){
                if(std::get<2>(e)){
                    int fu=ufs[0].fd(std::get<1>(e)),fv=ufs[0].fd(std::get<2>(e));
                    if(fu!=fv){
                        ufs[0].un(fu,fv);
                        ans=(ans+std::get<0>(e))%mod;
                    }
                }else{
                    int len=N-std::get<1>(e);
                    for(int i=17,p=1;~i;--i) if(len>>i&1){
                        un(p,p+std::get<1>(e),i,std::get<0>(e),ans);
                        p+=1<<i;
                    }
                }
            }
            printf("%lld\n",ans);
            return;
        }
        if(A==2){

        }
    }
}

int main(){
    //freopen("mst.in","r",stdin);
    //freopen("mst.out","w",stdout);
    xm::_();
    return 0;
}