#include <bits/stdc++.h>

using namespace std;
vector<int>tab[30007];
map<pair<int, int>, int>mapa;
set<pair<int, int>>s;
bool bfs(){

}
int main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);
    int n, w1, w2;
    cin >> n >> w1;
    for(int i = w1; i; --i){
        int a, b;
        cin >> a >> b;
        if(a > b){
            swap(a,b);
        }
        if(find(tab[a].begin(), tab[a].end(), b) != tab[a].end()) tab[a].push_back(b);
        if(find(tab[b].begin(), tab[b].end(), a) != tab[b].end()) tab[b].push_back(a);
        mapa[{a, b}]--;
        s.insert({a, b});
    }
    cin >> w2;
    for(int i = w2; i; --i){
        int a, b;
        cin >> a >> b;
        if(a > b){
            swap(a,b);
        }
        tab[a].push_back(b);
        tab[b].push_back(a);
        mapa[{a, b}]++;
        s.insert({a, b});
    }
    vector<pair<int, int>>p, m;
    for(auto i : s){
        if(mapa[i] > 0){
            p.push_back(i);
        } else if(mapa[i] < 0){
            m.push_back(i);
        }
    }
    for(auto i : p){
        cout << "+ " << i.first << " " << i.second << endl;
    }
    for(auto i : m){
        cout << "- " << i.first << " " << i.second << endl;
    }
}