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
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   vi         = vector<int>;
using   pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

vector<pair<pii, bool>> getOps(int n) {
	vector<vi> adj(n);
	vector<bool> has(n), seen(n);
	vector<pair<pii, bool>> ops;
	int m; cin >> m;

	rep(i, 0, m) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		if (u > v) swap(u, v);
		adj[u].pb(v);
		adj[v].pb(u);
		if (u == 0) {
			has[v] = 1;
		} else {
			ops.pb({{u, v}, 1});
		}
	}

	auto dfs = [&](auto self, int v) {
		if (seen[v]) return;
		seen[v] = 1;
		each(e, adj[v]) self(self, e);
		if (!has[v]) ops.pb({{0, v}, 0});
	};

	has[0] = 1;
	dfs(dfs, 0);
	return ops;
}

void run() {
	int n; cin >> n;
	auto A = getOps(n);
	auto B = getOps(n);

	reverse(all(A));
	each(e, A) e.y = !e.y;
	A.insert(A.end(), all(B));

	cout << sz(A) << '\n';
	each(e, A) {
		cout << "-+"[e.y] << ' ' << e.x.x+1 << ' ' << e.x.y+1 << '\n';
	}
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(10);
	run();
	cout << flush; _Exit(0);
}