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
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=30000+5;

int n, ms, md;
bool s_visited[MAXN];
bool d_visited[MAXN];
list<int> d_result;
list<pair<int, int>> result1;
list<pair<int, int>> result2;

list<int> se[MAXN];
set<pair<int, int>> ses;
list<int> de[MAXN];
set<pair<int, int>> des;

void load_graph(int &m, list<int> *e, set<pair<int, int>> &es) {
    SI(m);
    REP(i, m) {
        int a, b;
        SI(a);
        SI(b);
        e[a].push_back(b);
        e[b].push_back(a);
        if (a > b) {
            swap(a, b);
        }
        es.insert(make_pair(a, b));
    }
}

void bfs() {
    queue<int> q;
    q.push(1);
    s_visited[1] = true;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        FORE(ei, se[v]) {
            if (!s_visited[*ei]) {
                s_visited[*ei] = true;
                q.push(*ei);
                if (v != 1) {
                    result1.push_back(make_pair(1, *ei));
                }
            }
        }
    }
}

void bfs_reverse() {
    queue<int> q;
    q.push(1);
    d_visited[1] = true;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        FORE(ei, de[v]) {
            if (!d_visited[*ei]) {
                d_visited[*ei] = true;
                q.push(*ei);
                if (v != 1) {
                    d_result.push_front(*ei);
                }
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);

    SI(n);
    load_graph(ms, se, ses);
    load_graph(md, de, des);
    bfs();
    FORE(ei, des) {
        if (ei->first != 1 && !ses.contains(*ei)) {
            result1.push_back(make_pair(ei->first, ei->second));

        }
    }
    FORE(ei, ses) {
        if (ei->first != 1 && !des.contains(*ei)) {
            result2.push_back(make_pair(ei->first, ei->second));

        }
    }
    bfs_reverse();
    printf("%zu\n", result1.size() + result2.size() + d_result.size());
    FORE(ei, result1) {
        printf("+ %d %d\n", ei->first, ei->second);
    }
    FORE(ei, result2) {
        printf("- %d %d\n", ei->first, ei->second);
    }
    FORE(ei, d_result) {
        printf("- 1 %d\n", *ei);
    }

    return 0;
}