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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
					((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

vector<vi> G;
vector<tuple<char, int, int>> ops;
vi pre;
int tajm;

void dfs(int v) {
	pre[v] = ++tajm;
	if(v > 0 && *min_element(all(G[v])) > 0) ops.pb({'+', 0, v});
	for(auto &x: G[v]) {
		if(pre[x] == 0) dfs(x);
		if(x > 0 && pre[x] < pre[v]) ops.pb({'-', x, v});
	}
}

auto gwiazda(int n) {
	int m;
	cin >> m;
	G = vector<vi>(n);
	ops = {};
	pre = vi(n);
	tajm = 0;
	FOR(i, 0, m) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		G[a].pb(b), G[b].pb(a);
	}
	dfs(0);
	return ops;
}

void solve(){
	int n;
	cin >> n;
	auto r1 = gwiazda(n);
	auto r2 = gwiazda(n);
	for(int i = sz(r2) - 1; i >= 0; i--) {
		auto &[c, u, v] = r2[i];
		r1.pb({c ^ '+' ^ '-', u, v});
	}
	cout << sz(r1) << '\n';
	for(auto &[c, u, v]: r1) {
		cout << c << ' ' << u + 1 << ' ' << v + 1 << '\n';
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int tt = 1;
	// cin >> tt;
	FOR(te, 0, tt) solve();
	return 0;
}