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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, a, b;

struct czasteczka
{
    vector <int> l;
    bool vis;
    bool jest;
};
czasteczka tab[1000007];

void dfs(int nr, vector <pair<int, pair<int, int>>> &v)
{
    tab[nr].vis = 1;
    if(!tab[nr].jest)
        v.PB({1, {1, nr}});
    for(auto el : tab[nr].l)
    {
        if(!tab[el].vis)
            dfs(el, v);
        if(nr != 1 && nr < el)
            v.PB({0, {nr, el}});
    }
}

vector <pair<int, pair<int, int>>> rozwiaz()
{
    FOR(i, 1, n)
    {
        tab[i].l.clear();
        tab[i].vis = 0;
        tab[i].jest = 0;
    }
    tab[1].jest = 1;

    cin >> m;
    forr(i, m)
    {
        cin >> a >> b;
        tab[a].l.PB(b);
        tab[b].l.PB(a);
        if(a == 1)
            tab[b].jest = 1;
        if(b == 1)
            tab[a].jest = 1;
    }
    vector <pair<int, pair<int, int>>> v;
    dfs(1, v);
    return v;
}

int solve()
{
    cin >> n;
    auto v1 = rozwiaz();
    auto v2 = rozwiaz();
    reverse(v2.begin(), v2.end());

    cout << v1.size() + v2.size() << '\n';
    for(auto el : v1)
        cout << (el.ff ? '+' : '-') << " " << el.ss.ff << " " << el.ss.ss << '\n';
    for(auto el : v2)
        cout << (el.ff ? '-' : '+') << " " << el.ss.ff << " " << el.ss.ss << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}