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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#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;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

struct Graph: public vector<unordered_set<int> > {
    Graph(int n): vector<unordered_set<int> >(n) {}
    void addEdge(int u, int v) { THIS[u].insert(v); THIS[v].insert(u); }
};

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n; cin >> n;
    Graph s(n), d(n);
    int ms; cin >> ms;
    REP(i, ms) {
        int a, b; cin >> a >> b;
        s.addEdge(--a, --b);
    }
    int md; cin >> md;
    REP(i, md) {
        int a, b; cin >> a >> b;
        d.addEdge(--a, --b);
    }
    VPII toAdd, toRemove;
    REP(u, n) for (auto &v : s[u]) if (v > u && d[u].count(v) == 0) toRemove.PB({u, v});
    REP(u, n) for (auto &v : d[u]) if (v > u && s[u].count(v) == 0) toAdd.PB({u, v});

    VI visited(n);
    vector<pair<char, PII> > ans;
    visited[0] = true;
    queue<int> q;
    for (auto &u : s[0]) visited[u] = true;
    for (auto &u : s[0]) for (auto &v : s[u]) if (!visited[v]) { q.push(v); visited[v] = true; }
    while (!q.empty()) {
        int u = q.front(); q.pop();
        ans.PB({'+', {0, u}});
        for (auto &v : s[u]) if (!visited[v]) { q.push(v); visited[v] = true; }
    }
    for (auto &[u, v] : toAdd) if (u > 0) ans.PB({'+', {u, v}}); 
    for (auto &[u, v] : toRemove) if (u > 0) ans.PB({'-', {u, v}});

    visited.assign(n, 0);
    stack<int> tmp;
    visited[0] = true;
    for (auto &u : d[0]) visited[u] = true;
    for (auto &u : d[0]) for (auto &v : d[u]) if (!visited[v]) { q.push(v); visited[v] = true; }
    while (!q.empty()) {
        int u = q.front(); q.pop();
        tmp.push(u);
        for (auto &v : s[u]) if (!visited[v]) { q.push(v); visited[v] = true; }
    }
    while (!tmp.empty()) {
        ans.PB({'-', {0, tmp.top()}});
        tmp.pop();
    }
    cout << ans.size() << '\n';
    REP(i, ans.size()) cout << ans[i].ST << ' ' << ans[i].ND.ST + 1 << ' ' << ans[i].ND.ND + 1 << '\n';

    return 0;
}