#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m;
vector <int> G[30005];

struct info{
	int op,u,v;
};
vector <info> ans,output;

int fa[30005];
vector <int> ord;
void dfs(int u){
	ord.eb(u);
	for(int v:G[u]){
		if(fa[v] == -1){
			fa[v] = u;
			dfs(v);
		}
	}
}

int chk(int u,int v){
	int t = lower_bound(G[u].begin(),G[u].end(),v) - G[u].begin();
	if(t < SZ(G[u]) && G[u][t] == v) return 1;
	return 0;
}

void solver(){
	rep(u,1,n) sort(G[u].begin(),G[u].end());
	fill(fa,fa + n + 1,-1);
	fa[1] = 0;
	dfs(1);
	rep(i,2,n){
		int u = ord[i - 1];
		if(!chk(1,u)) ans.push_back({1,1,u});
	}
	rep(u,2,n){
		for(int v:G[u]) if(v > u) ans.push_back({0,u,v});
	}
}

int main(){	
//	freopen("test.in","r",stdin);
	scanf("%d%d",&n,&m);
	rep(i,1,m){
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].eb(v);G[v].eb(u);
	}
	solver();
	swap(ans,output);
	rep(u,1,n) G[u].clear();
	scanf("%d",&m);
	rep(i,1,m){
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].eb(v);G[v].eb(u);
	}
	solver();
	reverse(ans.begin(),ans.end());
	for(info &I:ans){
		I.op ^= 1;
		output.eb(I);
	}
	printf("%d\n",SZ(output));
	for(info &I:output){
		if(!I.op) printf("- ");
		else printf("+ ");
		printf("%d %d\n",I.u,I.v);
	}
	return 0;
}