#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5;
int n,m,idx,num;bool flag[M];
vector<pair<int,int>>g[M],adj[M],ans;
int u[M],v[M],id[M],bel[M],dfn[M],low[M],sum1[M],sum2[M],st[20][M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void Tarjan(int x,int f=0){
    dfn[x]=low[x]=++idx;
    for (auto [y,z]:g[x])
        if (!dfn[y]){
            Tarjan(y,x);
            low[x]=min(low[x],low[y]);
            if (dfn[x]<low[y]) flag[z]=1;
        }
        else if (y!=f)
            low[x]=min(low[x],dfn[y]);
}
void init(int x){bel[x]=num;
    for (auto [y,z]:g[x]){
        if (flag[z]) continue;
        flag[z]=1;
        ans.emplace_back(x,y);
        if (!bel[y]) init(y);
    }
}
void dfs(int x,int f){
    st[0][dfn[x]=++idx]=f;
    for (auto [y,z]:adj[x])
        if (y!=f) dfs(y,x),id[y]=z;
}
int cmp(int x,int y){return dfn[x]<dfn[y]?x:y;}
int lca(int x,int y){
    if (x==y) return x;
    if ((x=dfn[x])>(y=dfn[y])) swap(x,y);
    int k=31^__builtin_clz(y-x++);
    return cmp(st[k][x],st[k][y+1-(1<<k)]);
}
void getans(int x,int f){
    for (auto [y,z]:adj[x]){
        if (y==f) continue;getans(y,x);
        sum1[x]+=sum1[y];sum2[x]+=sum2[y];
    }
    if (sum1[x]&&sum2[x]) {puts("No");exit(0);}
    if (!f) return;
    if (bel[u[id[x]]]!=x) swap(u[id[x]],v[id[x]]);
    if (sum1[x]) ans.emplace_back(u[id[x]],v[id[x]]);
    else ans.emplace_back(v[id[x]],u[id[x]]);
}
int main(){
    n=read();m=read();
    for (int i=1;i<=m;i++){
        int x=read(),y=read();
        u[i]=x;v[i]=y;
        g[x].emplace_back(y,i);
        g[y].emplace_back(x,i);
    }
    for (int i=1;i<=n;i++)
        if (!dfn[i]) Tarjan(i);
    for (int i=1;i<=n;i++)
        if (!bel[i]) ++num,init(i);
    for (int i=1;i<=n;i++)
        for (auto [j,k]:g[i])
            if (bel[i]!=bel[j])
                adj[bel[i]].emplace_back(bel[j],k);
    idx=0;dfs(1,0);int q=read();
    int lg=31^__builtin_clz(num);
    for (int j=1;j<=lg;j++)
        for (int i=1;i+(1<<j)-1<=num;i++)
            st[j][i]=cmp(st[j-1][i],st[j-1][i+(1<<j-1)]);
    for (int i=1;i<=q;i++){
        int x=bel[read()],y=bel[read()],l=lca(x,y);
        sum1[x]++;sum1[l]--; sum2[y]++;sum2[l]--;
    }
    getans(1,0);  puts("Yes");
    for (auto [x,y]:ans) printf("%d %d\n",x,y);
    return 0;
}