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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=50100;
VI e[N];
int n,m;
bool vis[N];
vector<array<int,3>> gao(int sgn) {
	rep(i,1,n+1) {
		e[i].clear();
		vis[i]=0;
	}
	scanf("%d",&m);
	vector<array<int,2>> E;
	rep(i,0,m) {
		int u,v;
		scanf("%d%d",&u,&v);
		e[u].pb(v);
		e[v].pb(u);
		E.pb({u,v});
	}
	queue<int> q;
	q.push(1);
	vis[1]=1;
	vector<array<int,3>> ret;
	while (!q.empty()) {
		auto u=q.front(); q.pop();
		for (auto v:e[u]) if (!vis[v]) {
			vis[v]=1;
			q.push(v);
			if (u!=1) {
				ret.pb({sgn,1,v});
				E.pb({1,v});
			}
		}
	}
	for (auto [u,v]:E) if (u!=1&&v!=1) {
		ret.pb({1^sgn,u,v});
	}
	return ret;
}
int main() {
	scanf("%d",&n);
	auto d1=gao(0);
	auto d2=gao(1);
	reverse(all(d2));
	d1.insert(d1.end(),all(d2));
	printf("%d\n",SZ(d1));
	for (auto [op,x,y]:d1) printf("%c %d %d\n","+-"[op],x,y);
}