1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif
 
const ll mod = 1e9+7;
const int infi  = 1e9+1;
const ld eps = 1e-10L;
 
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n, m1, m2; cin >> n >> m1;
	vector<set<int>> adj(n+1);
	vector<pair<int,pair<int,int>>> ans;
	for(int i=0;i<m1;i++){
		int a, b; cin >> a >> b;
		adj[a].insert(b);
		adj[b].insert(a);
	}
	vector<bool> used(n+1, false);
	
	auto dfs = [&](auto &&dfs, int v) -> void {
		if(used[v]) return;
		used[v] = true;
		
		if(v!=1 && adj[1].find(v) == adj[1].end()) {
			ans.push_back({1,{1,v}});
			adj[1].insert(v);
			adj[v].insert(1);
		}
		
		for(auto u : adj[v]) {
			dfs(dfs, u);
		}
	};

	dfs(dfs, 1);

	vector<set<int>> zostaje(n+1);

	cin >> m2;
	for(int i=0;i<m2;i++){
		int a, b; cin >> a >> b;
		zostaje[a].insert(b);
		zostaje[b].insert(a);
		if(adj[a].find(b) == adj[a].end()){
			ans.push_back({1,{a,b}});
		}
	}

	fill(used.begin(), used.end(), false);

	auto dfs2 = [&](auto &&dfs2, int v) -> void {
		if(used[v]) return;
		used[v] = true;
		for(auto u : zostaje[v]) {
			dfs2(dfs2, u);
		}

		for(auto e : adj[v]) {
			if(zostaje[v].find(e) == zostaje[v].end() && e < v) {
				ans.push_back({0,{e,v}});
			}
		}

	};

	dfs2(dfs2, 1);
	cout << ans.size() << '\n';
	for(auto e : ans) {
		cout << (e.first == 1 ? "+ " : "- ") << e.second.first << " " << e.second.second << '\n';
	}

	return 0;
}