#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int,k>
template<class A, class B> void cmx(A& x, B y){ x = max<A>(x,y); }
template<class A, class B> void cmn(A& x, B y){ x = min<A>(x,y); }
typedef pair<int,int> pii;
typedef vector<int> vi;
const int LG = 18;
signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	int n,m; cin >> n >> m;
	vector<vector<pii>> adj(n);
	vector<pii> el(m);
	rep(i,0,m){
		int x,y; cin >> x >> y;
		x--; y--;
		adj[x].PB({y,i}); adj[y].PB({x,i});
		el[i] = {x,y};
	}
	// find bridges
	vi in(n),low(n); int ti = 0;
	vi br(m);
	auto dfs = [&](auto&& dfs, int u, int p, int pi)->void{
		in[u] = low[u] = ++ti;
		for(auto[v,i] : adj[u]) if(v != p){
			if(!in[v]){
				dfs(dfs,v,u,i);
				cmn(low[u],low[v]);
			} else{
				cmn(low[u],in[v]);
			}
		}
		if(low[u] == in[u] && p != -1){
			//cerr << "found bridge " << pi << "\n";
			br[pi] = 1;		
		}
	};
	dfs(dfs,0,-1,0);
	vi vis(n);
	vector<pii> ans(m);
	vi cid(n); int id = 0;
	rep(s,0,n) if(!vis[s]){
		auto dfs1 = [&](auto&& dfs1, int u, int p)->void{
			vis[u] = 1;
			cid[u] = id;
			for(auto[v,i] : adj[u]) if(v != p && !br[i]){
				if(!vis[v]){
					ans[i] = {u,v};
					dfs1(dfs1,v,u);
				} else if(vis[v] == 1){
					ans[i] = {u,v};
				}
			}
			vis[u] = 2;
		};
		dfs1(dfs1,s,-1);
		id++;
	}
	vector<vector<pii>> g(id);
	rep(i,0,m) if(br[i]){
		auto[u,v] = el[i];
		//cerr << "tree " << cid[u] << " " << cid[v] << "\n";
		assert(cid[u] != cid[v]);
		g[cid[u]].PB({cid[v],i});
		g[cid[v]].PB({cid[u],i});
	}
	vector<vi> tr(id,vi(LG));
	vi tin(id),out(id); ti = 0;
	auto dfs2 = [&](auto&& dfs2, int u, int p)->void{
		tr[u][0] = p;
		rep(i,1,LG) tr[u][i] = tr[tr[u][i-1]][i-1];
		tin[u] = ti++;
		for(auto[v,i] : g[u]) if(v != p){
			dfs2(dfs2,v,u);	
		}
		out[u] = ti-1;
	};
	dfs2(dfs2,0,0);
	auto anc = [&](int u, int v){
		return tin[u] <= tin[v] && out[u] >= out[v];
	};
	auto lca = [&](int u, int v){
		if(anc(u,v)) return u;
		if(anc(v,u)) return v;
		for(int i = LG-1; i >= 0; i--) if(!anc(tr[u][i],v)){
			u = tr[u][i];
		}
		return tr[u][0];
	};

	vi down(id),up(id);
	int q; cin >> q;
	while(q--){
		int u,v; cin >> u >> v;
		u--; v--;
		if(cid[u] == cid[v]) continue;
		u = cid[u], v = cid[v];
		int l = lca(u,v);
		//cerr << u << " " << v << " " << l << " query\n";
		up[u]++; 
		up[l]--;
		down[v]++;	
		down[l]--;
	}

	auto accum = [&](auto&& accum, int u, int p, int pi)->void{
		for(auto[v,i] : g[u]) if(v != p){
			accum(accum,v,u,i);
			down[u] += down[v];
			up[u] += up[v];
		}
		//cerr << "downs " << u << " " << up[u] << " " << down[u] <<  "\n";
		if(up[u] > 0 && down[u] > 0){
			cout << "No\n";
			exit(0);
		}
		if(p != -1){
			ans[pi] = el[pi];
			if(up[u] > 0){
				if(cid[ans[pi].FS] != u) swap(ans[pi].FS,ans[pi].SD);
			} else{
				if(cid[ans[pi].FS] != p) swap(ans[pi].FS,ans[pi].SD);
			}
		}
	};
	accum(accum,0,-1,0);
	cout << "Yes\n";
	rep(i,0,m){
		cout << ans[i].FS+1 << " " << ans[i].SD+1 << "\n";
	}
}