#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int MAXN = 1e5 + 1;

vector<set<int>> v;
ll cost[MAXN][MAXN];

void solve() {
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    v.resize(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        a--, b--;
        v[a].insert(b);
        v[b].insert(a);
        cost[a][b] = c;
    }
    int q;
    cin >> q;
    for (int j = 0; j < q; j++) {
        int key, a, b;
        ll c;
        cin >> key;
        if (key == 1) {
            cin >> a >> b >> c;
            v[a].insert(b);
            v[b].insert(a);
            cost[a][b] = c;
        }
        if (key == 2) {
            cin >> a >> b;
            v[a].erase(b);
            v[b].erase(a);
            cost[a][b] = -1;
        }
        if (key == 3) {
            cin >> a >> b;
            vector <ll> w;

            for (auto i : v[a]) {
                if (i == b) {
                    w.emplace_back(cost[a][b]);
                }
                for (auto i1 : v[i]) {
                    if (i1 == b) {
                        ll sum = cost[a][i] + cost[i1][b];
                        w.emplace_back(sum);
                    }
                }
            }

            ll ans = -1;
            if (!w.empty()) {
                ans = *min_element(w.begin(), w.end());
            }

            cout << ans << endl;
        }
    }
}

int main() {
    solve();
    return 0;
}