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
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
//#define int long long
//const int mod=1000000007;
//const int mod=1009;
const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=3e5+5;
vi P1[rozmiar],P2[rozmiar];
map<pii,int> M1,M2;
vii dodaj,odejmij;
bool O1[rozmiar],O2[rozmiar];
void dfs1(int n){
    O1[n]=1;
    if(n!=1&&!M1[mp(1,n)]){
        dodaj.pb(mp(1,n));
    }
    for(auto v:P1[n]){
        if(!O1[v])
            dfs1(v);
    }
}
void dfs2(int n){
    O2[n]=1;
    for(auto v:P2[n]){
        if(!O2[v])
            dfs2(v);
    }
    if(n!=1&&!M2[mp(1,n)]){
        odejmij.pb(mp(1,n));
    }
}
void solve()
{
    int n;
    cin>>n;
    int m1;
    cin>>m1;
    for(int i=1;i<=m1;i++){
        int a,b;
        cin>>a>>b;
        M1[mp(a,b)]=1;
        M1[mp(b,a)]=1;
        P1[a].pb(b);
        P1[b].pb(a);
    }
    int m2;
    cin>>m2;
    for(int i=1;i<=m2;i++){
        int a,b;
        cin>>a>>b;
        M2[mp(a,b)]=1;
        M2[mp(b,a)]=1;
        P2[a].pb(b);
        P2[b].pb(a);
    }
    dfs1(1);
    for(auto p:M2){
        pii el=p.st;
        if(el.st>el.nd)
            continue;
        if(!M1[el]&&el.st!=1&&el.nd!=1)
            dodaj.pb(el);
    }
    for(auto p:M1){
        pii el=p.st;
        if(el.st>el.nd)
            continue;
        if(!M2[el]&&el.st!=1&&el.nd!=1)
            odejmij.pb(el);
    }
    dfs2(1);
    cout<<dodaj.size()+odejmij.size()<<"\n";
    for(auto el:dodaj){
        cout<<"+ "<<el.st<<" "<<el.nd<<"\n";
    }
    for(auto el:odejmij){
        cout<<"- "<<el.st<<" "<<el.nd<<"\n";
    }

}
    
int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}