#include <bits/stdc++.h>
using namespace std;
int n, m;
int s, d, st, dt;
const int N = 2e5 + 5;
vector<pair<int, int> > edges, edges1, edges2, g;
int par[N];
int get(int i) {
  if (par[i] == i) return i;
  return par[i] = get(par[i]);
}
int ind[N];
set<int> sett, sett2, unionn;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) par[i] = i;
  for (int i = 0, u, v; i < m; i++) {
    cin >> u >> v;
    edges.push_back(make_pair(u, v));
  }
  cin >> s >> d >> st >> dt;
  for (int i = 0; i < m; i++) {
    int u = edges[i].first;
    int v = edges[i].second;
    if ((u == s && v == d) || (u == d && v == s)) {
      edges2.push_back(make_pair(u, v));
      continue;
    }
    if (u == s || v == s || u == d || v == d) {
      edges1.push_back(make_pair(u, v));
      continue;
    }
    int r = get(u), r1 = get(v);
    if (r == r1) continue;
    par[r] = r1;
    g.push_back(make_pair(u, v));
  }
  for (int i = 0; i < edges1.size(); i++) {
    int u = edges1[i].first;
    int v = edges1[i].second;
    if (u == s || u == d) swap(u, v);
    int r = get(u);
    if (v == s)
      sett.insert(r);
    else
      sett2.insert(r);
  }
  for (set<int>::iterator it = sett.begin(); it != sett.end(); it++)
    if (sett2.find(*it) != sett2.end()) unionn.insert(*it);
  ind[s] = st, ind[d] = dt;
  for (int i = 0; i < edges1.size(); i++) {
    int u = edges1[i].first;
    int v = edges1[i].second;
    if (u == s || u == d) swap(u, v);
    int r = get(u);
    if (r == v) continue;
    if (unionn.find(r) != unionn.end()) {
      continue;
    }
    if (v == s) {
      ind[s]--;
      g.push_back(make_pair(u, s));
    } else {
      ind[d]--;
      g.push_back(make_pair(u, d));
    }
    par[r] = v;
  }
  if (ind[s] <= 0 || ind[d] <= 0) return cout << "No" << endl, 0;
  int f = 0;
  if (edges2.size() && ind[s] + ind[d] - 2 >= unionn.size()) f = 1;
  if (unionn.size() && ind[s] + ind[d] >= unionn.size() + 1) f = 2;
  if (!f) return cout << "No" << endl, 0;
  if (f == 1) {
    g.push_back(make_pair(s, d));
    ind[s]--, ind[d]--;
    par[s] = d;
    for (int i = 0; i < edges1.size(); i++) {
      int u = edges1[i].first;
      int v = edges1[i].second;
      if (u == s || u == d) swap(u, v);
      int r = get(u), r2 = get(v);
      if (r == r2) continue;
      if (ind[s] > 0 && v == s) {
        g.push_back(make_pair(s, u));
        ind[s]--;
        par[r] = r2;
        continue;
      }
      if (ind[d] > 0 && v == d) {
        g.push_back(make_pair(d, u));
        ind[d]--;
        par[r] = r2;
      }
    }
    if (ind[s] < 0 || ind[d] < 0) return cout << "No" << endl, 0;
  } else {
    for (int i = 0; i < edges1.size(); i++) {
      int u = edges1[i].first;
      int v = edges1[i].second;
      if (u == s || u == d) swap(u, v);
      int r = get(u), r2 = get(v);
      if (r == r2) continue;
      if (ind[s] > 0 && s == v) {
        g.push_back(make_pair(s, u));
        ind[s]--;
        par[r] = r2;
        continue;
      }
      if (ind[d] > 0 && v == d) {
        g.push_back(make_pair(d, u));
        ind[d]--;
        par[r] = r2;
      }
    }
    if (ind[s] < 0 || ind[d] < 0) return cout << "No" << endl, 0;
  }
  int r = get(1);
  for (int i = 2; i <= n; i++)
    if (get(i) != r) return cout << "No" << endl, 0;
  cout << "Yes" << '\n';
  for (int i = 0; i < g.size(); i++)
    cout << g[i].first << " " << g[i].second << '\n';
  return 0;
}
