#include <bits/stdc++.h>
#define ff first
#define ss second;
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int SZ = 101010;

int n, m, u[SZ], v[SZ], bcc[SZ], par[SZ];
vector<pii> g[SZ];

int sp, bc, dfn[SZ], top[SZ];

void spoil(int p, int v) {
    for (auto [e, x] : g[v]) if (p != e && par[x] == v && !bcc[x]) {
        bcc[x] = bcc[v];
        spoil(e, x);
    }
}
void dfs(int p, int v) {
    dfn[v] = ++sp;
    top[v] = sp;
    for (auto [e, x] : g[v]) if (p != e) {
        if (!dfn[x]) {
            par[x] = v;
            dfs(e, x);
            top[v] = min(top[v], top[x]);
            if (top[x] == dfn[x]) {
                bcc[x] = ++bc;
                spoil(e, x);
            }
        }
        else if (dfn[x] < dfn[v]) {
            top[v] = min(top[v], dfn[x]);
        }
    }
}
vector<int> h[SZ];

struct dsu {
    int par[SZ];
    void init() {
        iota(par, par + SZ, 0);
    }
    int find(int a) {
        return par[a] = ((par[a] == a) ? a : find(par[a]));
    }
    void merge(int a, int b) { 
        a = find(a);
        b = find(b);
        par[b] = a;
    }
} dsu[2];

int dep[SZ], pp[20][SZ];
void dfss(int p, int v) {
    for (int x : h[v]) if (p != x) {
        pp[0][x] = v;
        dep[x] = dep[v] + 1;
        dfss(v, x);
    }
}
int lca(int u, int v) {
    if (dep[u] > dep[v]) swap(u, v);
    int d = dep[v] - dep[u];
    for (int j = 0; j < 20; j++) if (d >> j & 1) v = pp[j][v];
    for (int j = 20; j > 0; j--) {
        if (pp[j - 1][u] != pp[j - 1][v]) {
            u = pp[j - 1][u];
            v = pp[j - 1][v];
        }
    }
    return u == v ? u : pp[0][u];
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> u[i] >> v[i];
        g[u[i]].push_back({i, v[i]});
        g[v[i]].push_back({i, u[i]});
    }
    for (int i = 1; i <= n; i++) {
        if (!dfn[i]) {
            assert(i == 1);
            dfs(-1, i);
            bcc[i] = ++bc;
            spoil(-1, i);
        }
    }
    int cnt = 0;
    for (int i = 0; i < m; i++) {
        if (bcc[u[i]] != bcc[v[i]]) {
            int x = bcc[u[i]];
            int y = bcc[v[i]];
            h[x].push_back(y);
            h[y].push_back(x);
            ++cnt;
        }
    }
    assert(cnt == bc - 1);
    // for (int i = 1; i <= bc; i++) {
    //     sort(h[i].begin(), h[i].end());
    //     h[i].erase(unique(h[i].begin(), h[i].end()), h[i].end());
    // }
    // h[i] is a tree
    dsu[0].init();
    dsu[1].init();
    dfss(-1, 1);
    for (int j = 1; j < 20; j++) for (int i = 1; i <= bc; i++) {
        pp[j][i] = pp[j - 1][pp[j - 1][i]];
    }
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        int u, v;
        cin >> u >> v;
        u = bcc[u];
        v = bcc[v];
        if (u != v) {
            int l = lca(u, v);
            
            for (int x = dsu[0].find(u); x != 1 && dep[x] > dep[l]; x = dsu[0].find(pp[0][x])) {
                // cout << "merge " << pp[0][x] << ' ' << "with " << x << ", color " << 1 << '\n';
                dsu[0].merge(pp[0][x], x);
            }
            for (int x = dsu[1].find(v); x != 1 && dep[x] > dep[l]; x = dsu[1].find(pp[0][x])) {
                // cout << "merge " << pp[0][x] << ' ' << "with " << x << ", color " << 2 << '\n';
                dsu[1].merge(pp[0][x], x);
            }
        }
    }
    int dir[m] = {};
    for (int i = 0; i < m; i++) {
        if (bcc[u[i]] != bcc[v[i]]) {
            int x = bcc[u[i]];
            int y = bcc[v[i]];
            if (pp[0][x] == y) {
                int a = dsu[0].find(x) == x ? 0 : 1;
                int b = dsu[1].find(x) == x ? 0 : 2;
                if (a && b) return !(cout << "No\n");
                else dir[i] = (a + b == 0) ? 1 : a + b;
            }
            else {
                int a = dsu[0].find(y) == y ? 0 : 2;
                int b = dsu[1].find(y) == y ? 0 : 1;
                if (a && b) return !(cout << "No\n");
                else dir[i] = (a + b == 0) ? 1 : a + b;
            }
        }
    }
    cout << "Yes\n";
    for (int i = 0; i < m; i++) {
        if (dir[i] == 1) cout << u[i] << ' ' << v[i] << '\n';
        else if (dir[i] == 2) cout << v[i] << ' ' << u[i] << '\n';
        else {
            int x = u[i], y = v[i];
            if (par[x] == y) {
                cout << y << ' ' << x << '\n';
            }
            else if (par[y] == x) {
                cout << x << ' ' << y << '\n';
            }
            else {
                if (dfn[x] > dfn[y]) cout << x << ' ' << y << '\n';
                else cout << y << ' ' << x << '\n';
            }
        }
    }

}