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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <stdio.h>
#include <string.h>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
using namespace std;
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vvi vector<vi>
#define fi first
#define se second
#define ll long long
#define ld long double
void test_case() {
    int n;
    cin >> n;
    int m_s;
    cin >> m_s;
    vvi adj_s(n + 1);
    set<ii> st_s;
    for(int i = 0; i < m_s; i++) {
        int u, v;
        cin >> u >> v;
        adj_s[u].pb(v);
        adj_s[v].pb(u);
        if(u > v) swap(u, v);
        st_s.insert({u,v});
    }
    int m_d;
    cin >> m_d;
    vvi adj_d(n + 1);
    set<ii> st_d;
    for(int i = 0; i < m_d; i++) {
        int u, v;
        cin >> u >> v;
        adj_d[u].pb(v);
        adj_d[v].pb(u);
        if(u > v) swap(u, v);
        st_d.insert({u,v});
    }
    vvi ans; // 1 to +, 0 to -
    // laczenie wszystkiego z 1
    queue<int> q;
    vi dist1(n + 1, -1);
    dist1[1] = 0;
    q.push(1);
    while(q.size() > 0) {
        int u = q.front();
        q.pop();
        if(dist1[u] > 1) {
            ans.pb({1, 1, u});
        }
        for(auto v : adj_s[u]) {
            if(dist1[v] == -1) {
                dist1[v] = dist1[u] + 1;
                q.push(v);
            }
        }
    }
    // poprawienie wszystkich krawedzi poza incydentnymi z 1
    for(auto p : st_s) {
        if(p.fi == 1) continue;
        if(st_d.count(p) == 0) {
            ans.pb({0, p.fi, p.se});
        }
    }
    for(auto p : st_d) {
        if(p.fi == 1) continue;
        if(st_s.count(p) == 0) {
            ans.pb({1, p.fi, p.se});
        }
    }
    // usuwanie niechcianych z 1
    vi dist2(n + 1, -1);
    dist2[1] = 0;
    q.push(1);
    while(q.size() > 0) {
        int u = q.front();
        q.pop();
        for(auto v : adj_d[u]) {
            if(dist2[v] == -1) {
                dist2[v] = dist2[u] + 1;
                q.push(v);
            }
        }
    }
    vi nodes(n, 0);
    iota(all(nodes), 1);
    sort(all(nodes), [&](int &a, int &b) {
        if(dist2[a] == dist2[b]) {
            return a < b;
        } else return dist2[a] > dist2[b];
    });
    for(int i = 0; i < n; i++) {
        int u = nodes[i];
        if(dist2[u] <= 1) break;
        if(st_d.count({1, u}) == 0) {
            ans.pb({0, 1, u});
        }
    }
    cout << ans.size() << "\n";
    for(auto v : ans) {
        cout << (v[0] == 0 ? '-' : '+') << " " << v[1] << " " << v[2] << "\n";
    }
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int tc = 1;
    // cin >> tc;
    while(tc--) {
        test_case();
    }
    return 0;
}