#include <bits/stdc++.h>

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
bool umx (T& a, T b) {
    return (a < b ? a = b, 1 : 0);
}
template <typename T>
bool umn (T& a, T b) {
    return (a > b ? a = b, 1 : 0);
}
using ll = long long;
using ld = long double;

const int mod = 998244353;
const int N = 2000 + 22;
int n, m, q;
int x[N], y[N], w[N], p[N];
int ans[N];
int get (int x) {
    return (x == p[x] ? x : p[x] = get (p[x]));
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif //LOCAL
    while (1) {
        cin >> n >> m;
        if (!n && !m) return 0;
        for (int i = 1; i <= m; ++i) {
            cin >> x[i] >> y[i] >> w[i];
        }
        vector<int> id (m);
        iota (begin (id), end (id), 1);
        sort (begin (id), end (id), [&] (int a, int b) {
            return w[a] < w[b];
        });
        cin >> q;
        for (int i = 1; i <= n; ++i) p[i] = i;
        vector<array<int,3>> v1;
        vector<array<int,4>> v2;
        vector<int> type (q + 1);
        for (int i = 1; i <= q; ++i) {
            char c;
            cin >> c;
            if (c == 'R' || c == 'B') {
                type[i] = 1;
                int id, k;
                cin >> id >> k;
                v1.push_back({i, id, k});
            } else {
                int a, b, k;
                cin >> a >> b >> k;
                v2.push_back({i, a, b, k});
            }
        }
        int now = 1, c0 = 0, c1 = 0;
        while (now <= q) {
            while (now <= q && type[now] == 1) {
                w[v1[c0][1]] = v1[c0][2];
                ++now;
                ++c0;
            }
            vector<array<int,3>> ve;
            for (int i = 1; i <= n; ++i) p[i] = i;
            for (int i = 1; i <= m; ++i) ve.push_back({w[i], x[i], y[i]});
            sort (rbegin (ve), rend (ve));
            vector<array<int,4>> quer;
            while (now <= q && type[now] == 0) {
                quer.push_back (v2[c1]);
                ++now;
                ++c1;
            }
            sort (begin (quer), end (quer), [&] (array<int,4> a, array<int,4> b) {
                return a[3] > b[3];
            });
            int ukaz = 0;
            for (auto it : quer) {
                while (ukaz < (int)ve.size() && ve[ukaz][0] >= it[3]) {
                    int u = get (ve[ukaz][1]), v = get(ve[ukaz][2]);
                    if (u != v) p[u] = v;
                    ++ukaz;
                }
                int u = get (it[1]), v = get (it[2]);
                if (u == v) ans[it[0]] = 2;
                else ans[it[0]] = 1;
            }
        }
        for (int i = 1; i <= q; ++i) {
            if (ans[i]) cout << ans[i] - 1 << '\n';
            ans[i] = 0;
        }

    }
    return 0;
}