https://www.luogu.com.cn/record/88585115

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
struct edge {
	int pos, to, next;
} e[N << 1];
int n, m, k, u, v, ans, id = INT_MAX, tot, cnt, cnt2, cnts;
int val[N], dis[N], a[N], mid[N], deg[N], dfn[N], low[N], pos[N], head[N];
bool flag, vis[N], qwq[N];
stack<int> s;
queue<int> q;
void add(int u, int v) {
	e[++ cnts].to = v;
	e[cnts].pos = u;
	e[cnts].next = head[u];
	head[u] = cnts;
}
void tarjan(int u) {
	dfn[u] = low[u] = ++ tot;
	s.push(u), vis[u] = true;
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].to;
		if (!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);
		else if (vis[v]) low[u] = min(low[u], low[v]);
	}
	if (dfn[u] == low[u]) {
		int awa = 0x3f3f3f3f;
		cnt ++;
		while (s.top() != u) {
			int v = s.top(); s.pop();
			pos[v] = cnt, vis[v] = false, awa = min(awa, v);
			if (qwq[v]) val[cnt] = min(val[cnt], a[v]);
		}
		s.pop(), pos[u] = cnt, vis[u] = false, mid[cnt] = min(awa, u);
		if (qwq[u]) val[cnt] = min(val[cnt], a[u]);
	}
}
int main() {
	memset(val, 0x3f, sizeof val);
	cin >> n >> k;
	for (int i = 1; i <= k; i ++)
		cin >> u >> v, qwq[u] = true, a[u] = v;
	cin >> m;
	for (int i = 1; i <= m; i ++)
		cin >> u >> v, add(u, v);
	for (int i = 1; i <= n; i ++)
		if (!dfn[i]) tarjan(i);
	for (int i = 1; i <= m; i ++) {
		int u = pos[e[i].pos], v = pos[e[i].to];
		if (u != v) deg[v] ++;
	}
	for (int i = 1; i <= n; i ++) {
		if (deg[pos[i]]) continue;
		if (val[pos[i]] == 0x3f3f3f3f)
			flag = true, id = min(id, mid[pos[i]]);
		ans += val[pos[i]];
	}
	if (flag) cout << "NO\n" << id << '\n';
	else cout << "YES\n" << ans << '\n';
	return 0;
}