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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,L;
vector<int> E[202020];
int from[202020];
int to[202020];
int NG[202020];
int dp[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,M) {
		cin>>x>>y;
		E[x-1].push_back(y-1);
		E[y-1].push_back(x-1);
	}
	MINUS(from);
	cin>>L;
	FOR(i,L) {
		cin>>x>>y;
		from[x-1]=max(from[x-1],y);
	}
	FOR(i,1010) {
		FOR(j,N) to[j]=-1;
		FOR(j,N) if(from[j]>=0) {
			NG[j]=1;
			to[j]=max(to[j],from[j]-1);
			FORR(e,E[j]) to[e]=max(to[e],from[j]-1);
		}
		swap(from,to);
	}
	return;
	FOR(i,N) dp[i]=1<<20;
	dp[0]=0;
	queue<int> Q;
	Q.push(0);
	while(Q.size()) {
		int cur=Q.front();
		Q.pop();
		if(cur==N-1) {
			cout<<"Yes"<<endl;
			cout<<dp[N-1]<<endl;
			return;
		}
		FORR(e,E[cur]) if(chmin(dp[e],dp[cur]+1)&&NG[e]==0) Q.push(e);
	}
	cout<<"No"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}