#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,sparse[31][220000],depth[220000],sum[220000],par[220000],pos[220000],neg[220000],okay,q;
vector<ll> v[220000],u[220000],add[220000],del[220000];
vector<pair<ll,ll>> ans;
void dfs(ll x,ll y)
{
    sparse[0][x]=y;
    depth[x]=depth[y]+1;
    ll i;
    for(auto xx:v[x])
    {
        if(depth[xx]==0)
        {
            u[x].push_back(xx);
            dfs(xx,x);
            continue;
        }
        if(depth[xx]>depth[x])
        {
            ans.push_back({x,xx});
            sum[xx]++;
            sum[x]--;
        }
    }
}
ll f(ll x)
{
    if(par[x]==x)
        return x;
    par[x]=f(par[x]);
    return par[x];
}
void g(ll x,ll y)
{
    x=f(x);
    y=f(y);
    if(x==y)
        return;
    if(depth[x]>depth[y])
        swap(x,y);
    par[y]=x;
}
ll dfs2(ll x)
{
    ll i,s=0;
    for(auto xx:u[x])
    {
        s+=dfs2(xx);
    }
    s+=sum[x];
    if(s>0)
    {
        g(x,sparse[0][x]);
    }
    return s;
}
ll dfs3(ll x)
{
    ll i,s=0;
    for(auto xx:u[x])
    {
        s+=dfs3(xx);
        pos[x]+=pos[xx];
        neg[x]+=neg[xx];
    }
    for(auto xx:add[x])
    {
        if(xx==1)
            pos[x]++;
        else
            neg[x]++;
    }
    for(auto xx:del[x])
    {
        if(xx==1)
            pos[x]--;
        else
            neg[x]--;
    }
    s+=sum[x];
    if(s>0)
    {
        ans.push_back({x,sparse[0][x]});
    }
    else
    {
        if(pos[x]&&neg[x])
        {
            okay=0;
        }
        else if(pos[x])
        ans.push_back({x,sparse[0][x]});
        else
        ans.push_back({sparse[0][x],x});
    }
    return s;
}
ll lca(ll x,ll y)
{
    if(depth[x]>depth[y])
        swap(x,y);
    ll z=depth[y]-depth[x],w=0;
    while(z)
    {
        if(z&1)
            y=sparse[w][y];
        w++;
        z>>=1;
    }
    if(x==y)
    return x;
    w=30;
    while(w>=0)
    {
        if(sparse[w][x]!=sparse[w][y])
        {
            x=sparse[w][x];
            y=sparse[w][y];
        }
        w--;
    }
    x=sparse[0][x];
    return x;
}
int main()
{
    scanf("%lld %lld",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%lld %lld",&x,&y);
        if(x>y)
            swap(x,y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i=1;i<=n;i++)
    {
        par[i]=i;
    }
    dfs(1,0);
    dfs2(1);
    for(i=1;i<=30;i++)
    {
        for(j=1;j<=n;j++)
        {
            sparse[i][j]=sparse[i-1][sparse[i-1][j]];
        }
    }
    scanf("%lld",&q);
    for(i=1;i<=q;i++)
    {
        scanf("%lld %lld",&x,&y);
        x=f(x);
        y=f(y);
        if(x==y)
            continue;
        /*if(ancestor(x,y))
        {
            z=asdf(x,y);
            add[x].push_back(1);
            del[z].push_back(1);
            continue;
        }
        if(ancestor(y,x))
        {
            z=asdf(y,x);
            add[y].push_back(-1);
            del[z].push_back(-1);
            continue;
        }*/
        z=lca(x,y);
        add[x].push_back(1);
        add[y].push_back(-1);
        del[z].push_back(1);
        del[z].push_back(-1);
    }
    okay=1;
    dfs3(1);
    if(!okay)
    {
        printf("No");
        return 0;
    }
    printf("Yes\n");
    for(auto pp:ans)
    {
        if(pp.first&&pp.second)
        printf("%lld %lld\n",pp.first,pp.second);
    }
}