1517：间谍网络(tarjan+缩点

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10;
struct node{
    int to,nxt;
}d[N*2],d2[N*2];int head[N*2],tot=0,tot2=0,head2[N*2];
void add(int a,int b){d[++tot]={b,head[a]};head[a]=tot;}
void add2(int a,int b){d2[++tot2]={b,head2[a]};head2[a]=tot2;}
int low[N],dfn[N],Stack[N],belong[N];
int Index,top,scc,num[N];
bool instack[N];
int ans=0;int val[N],pos=1e9,val2[N],val3[N];
void tarjan(int u){
    int v;
    low[u]=dfn[u]=++Index;
    Stack[top++]=u;
    instack[u]=true;
    for(int i=head[u];i;i=d[i].nxt){
        v=d[i].to;
        if(!dfn[v]){
            tarjan(v);
            if(low[u]>low[v]){
                low[u]=low[v];
            }
        }else if(instack[v]&&low[u]>dfn[v]){
            low[u]=low[v];
        }
    }
    if(low[u]==dfn[u]){
        scc++;int mini=1e9,minipos=1e9;
        do{
            v=Stack[--top];
            instack[v]=false;
            belong[v]=scc;num[scc]++;
            mini=min(mini,val[v]);
            minipos=min(minipos,v);
        }while(v!=u);
        val2[scc]=mini;
        val3[scc]=minipos;
    }
    return ;
}
void solve(int n){
    memset(dfn,0,sizeof dfn);
    memset(instack,false,sizeof instack);
    memset(num,0,sizeof num);
    Index=scc=top=0;
    for(int i=1;i<=n;i++){
        if(!dfn[i]) tarjan(i);
    }
}
void init(){
    tot=0;memset(head,0,sizeof head);
}
int n,m;
int in[N],out[N];
int32_t main(){
    scanf("%lld",&n);
    init();
    memset(val,0x3f,sizeof val);
    int p;scanf("%lld",&p);for(int i=1;i<=p;i++){
    	int a,b;scanf("%lld%lld",&a,&b);val[a]=b;
	}
	int m;scanf("%lld",&m);
	for(int i=1;i<=m;i++){
		int a,b;scanf("%lld%lld",&a,&b);add(a,b);
	}
	solve(n);queue<int> Q;
	for(int i=1;i<=n;i++){
		for(int j=head[i];j;j=d[j].nxt){
			int to=d[j].to;
			int bx=belong[i],by=belong[to];
			if(bx!=by){
				add2(bx,by);in[by]++;
			}
		}
	}
	int pos=1e9,fl=0,ans=0;
	for(int i=1;i<=scc;i++) if(in[i]==0){
		 Q.push(i);
		 ans+=val2[i];
		 if(val2[i]>=1e9)  fl=1,pos=min(pos,val3[i]);
	}
	if(fl==1){
		cout<<"NO"<<endl;
		cout<<pos<<endl;
	}else{
		cout<<"YES"<<endl;
		cout<<ans<<endl;
	}
}