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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (b); i >= (a); i--)
#define SZ(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
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 << "}";
}
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { ((cerr<<$<<"; "),...) << endl; }(x)

const int nax = 1e5 + 5;
set<pii> kraw[2];
int m[2];
set<int> adj[2][nax];
bool vis[2][nax];
int n;

void add_edge(int id, int x, int y){
    if(x > y) swap(x, y);
    kraw[id].insert(mp(x, y));
    adj[id][x].insert(y);
    adj[id][y].insert(x);
}

vector<tuple<char, int, int>> track, ans;

void dfs(int id, int v, int p){
    vis[id][v] = true;
    if(v != 1){
        if(!kraw[id].count(mp(1, v))){
            track.pb(mt('+', 1, v));
        }
    }
    for(int x : adj[id][v]){
        if(vis[id][x]) continue;
        dfs(id, x, v);
    }
}

void zrob(int id){
    track.clear();
    dfs(id, 1, 1);
    vector<pii> todo;
    for(auto [x, y] : kraw[id]){
        if(x != 1) todo.pb(mp(x, y));
    }
    for(auto [x, y] : todo){
        track.pb(mt('-', x, y));
    }
}

void solve(){
    cin >> n;
    rep(i, 0, 1){
        cin >> m[i];
        rep(e, 1, m[i]){
            int x, y; cin >> x >> y;
            add_edge(i, x, y);
        }
    }
    zrob(0);
    ans = track;
    zrob(1);
    reverse(all(track));
    for(auto [x, y, z] : track){
        if(x == '+') ans.pb(mt('-', y, z));
        else ans.pb(mt('+', y, z));
    }
    cout << SZ(ans) << "\n";
    for(auto [x, y, z] : ans) cout << x << " " << y << " " << z << "\n";
}

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