Problem: Baldman is a warp master. He possesses a unique ability — creating wormholes! Given two positions in space, Baldman can make a wormhole which makes it possible to move between them in both directions. Unfortunately, such operation isn't free for Baldman: each created wormhole makes him lose plenty of hair from his head.

Because of such extraordinary abilities, Baldman has caught the military's attention. He has been charged with a special task. But first things first.

The military base consists of several underground objects, some of which are connected with bidirectional tunnels. There necessarily exists a path through the tunnel system between each pair of objects. Additionally, exactly two objects are connected with surface. For the purposes of security, a patrol inspects the tunnel system every day: he enters one of the objects which are connected with surface, walks the base passing each tunnel at least once and leaves through one of the objects connected with surface. He can enter and leave either through the same object, or through different objects. The military management noticed that the patrol visits some of the tunnels multiple times and decided to optimize the process. Now they are faced with a problem: a system of wormholes needs to be made to allow of a patrolling which passes each tunnel exactly once. At the same time a patrol is allowed to pass each wormhole any number of times.

This is where Baldman comes to operation: he is the one to plan and build the system of the wormholes. Unfortunately for him, because of strict confidentiality the military can't tell him the arrangement of tunnels. Instead, they insist that his system of portals solves the problem for any arrangement of tunnels which satisfies the given condition. Nevertheless, Baldman has some information: he knows which pairs of objects he can potentially connect and how much it would cost him (in hair). Moreover, tomorrow he will be told which objects (exactly two) are connected with surface. Of course, our hero decided not to waste any time and calculate the minimal cost of getting the job done for some pairs of objects (which he finds likely to be the ones connected with surface). Help Baldman!

Input

First line of the input contains a single natural number n (2 ≤ n ≤ 100000) — the number of objects on the military base. The second line — one number m (1 ≤ m ≤ 200000) — the number of the wormholes Baldman can make. The following m lines describe the wormholes: each line contains three integer numbers a, b, c (1 ≤ a, b ≤ n, 1 ≤ c ≤ 100000) — the numbers of objects which can be connected and the number of hair Baldman has to spend to make this wormhole.

The next line contains one natural number q (1 ≤ q ≤ 100000) — the number of queries. Finally, the last q lines contain a description of one query each — a pair of numbers of different objects ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi). There could be more than one wormhole between a pair of objects.

Output

Your program should output q lines, one for each query. The i-th line should contain a single integer number — the answer for i-th query: the minimum cost (in hair) of a system of wormholes allowing the optimal patrol for any system of tunnels (satisfying the given conditions) if ai and bi are the two objects connected with surface, or "-1" if such system of wormholes cannot be made.

Examples

Input

2
1
1 2 3
1
1 2


Output

0


Input

3
1
1 2 3
2
1 2
1 3


Output

-1
3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Edge {
  int s, t, c;
  void input() {
    scanf("%d%d%d", &s, &t, &c);
    --s;
    --t;
  }
  bool operator<(const Edge& e) const { return c < e.c; }
};
const int MAX_VERTEX = 100000 + 100;
const int MAX_EDGE = 200000 + 100;
Edge edges[MAX_EDGE];
struct UF {
  int rank[MAX_VERTEX];
  int father[MAX_VERTEX];
  void makeUse(int n) {
    for (int i = 0; i < n; i++) {
      father[i] = i;
      rank[i] = 0;
    }
  }
  int find(int x) {
    if (x == father[x]) return x;
    return father[x] = find(father[x]);
  }
  int unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (rank[a] < rank[b]) {
      father[a] = b;
    } else {
      father[b] = a;
    }
    if (rank[a] == rank[b]) rank[a]++;
    return find(a);
  }
  bool link(int a, int b) { return find(a) == find(b); }
};
int nVets, nEdges;
void inputGraph() {
  scanf("%d%d", &nVets, &nEdges);
  for (int i = 0; i < nEdges; i++) {
    edges[i].input();
  }
}
int treeCnt;
long long treeCost;
UF U;
bool inMST[MAX_EDGE];
void calcMST() {
  U.makeUse(nVets);
  sort(edges, edges + nEdges);
  treeCnt = nVets;
  treeCost = 0;
  for (int edgeId = 0; edgeId < nEdges; edgeId++) {
    Edge& e = edges[edgeId];
    if (!U.link(e.s, e.t)) {
      U.unite(e.s, e.t);
      treeCnt--;
      treeCost += e.c;
      inMST[edgeId] = true;
    } else {
      inMST[edgeId] = false;
    }
  }
}
const int MAX_QUERYS = 100000 + 100;
int maxEdge[MAX_QUERYS];
struct Query {
  int a, b;
};
Query querys[MAX_QUERYS];
struct Node {
  Node *l, *r;
  int id;
  int len;
  vector<int> qs;
  Node(Node* _l, Node* _r, int _id, int _len)
      : l(_l), r(_r), id(_id), len(_len) {}
  int dfs();
};
Node* nodes[MAX_VERTEX];
Node* root[MAX_VERTEX];
int Node::dfs() {
  if (id != -1) {
    for (__typeof(qs.begin()) qIt = qs.begin(); qIt != qs.end(); qIt++) {
      int qId = *qIt;
      int other = querys[qId].a + querys[qId].b - id;
      if (root[U.find(other)] != 0) {
        maxEdge[qId] = root[U.find(other)]->len;
      }
    }
    return id;
  }
  int x = l->dfs();
  root[U.find(x)] = this;
  return U.unite(x, r->dfs());
}
int nQuerys;
void solve() {
  calcMST();
  scanf("%d", &nQuerys);
  if (treeCnt > 2) {
    for (int i = 0; i < nQuerys; i++) puts("-1");
    return;
  } else if (treeCnt == 2) {
    for (int i = 0; i < nQuerys; i++) {
      int a, b;
      scanf("%d%d", &a, &b);
      --a;
      --b;
      if (U.link(a, b))
        puts("-1");
      else
        printf(
            "%I64d"
            "\n",
            treeCost);
    }
  } else {
    U.makeUse(nVets);
    for (int i = 0; i < nVets; i++) {
      nodes[i] = new Node(0, 0, i, -1);
    }
    memset(maxEdge, -1, sizeof(int) * nQuerys);
    for (int i = 0; i < nQuerys; i++) {
      Query& query = querys[i];
      scanf("%d%d", &query.a, &query.b);
      query.a--;
      query.b--;
      nodes[query.a]->qs.push_back(i);
      nodes[query.b]->qs.push_back(i);
    }
    for (int eId = 0; eId < nEdges; eId++)
      if (inMST[eId]) {
        Edge& e = edges[eId];
        Node* t = new Node(nodes[U.find(e.s)], nodes[U.find(e.t)], -1, e.c);
        nodes[U.unite(e.s, e.t)] = t;
      }
    memset(root, 0, sizeof(Node*) * nVets);
    int vs = U.find(0);
    U.makeUse(nVets);
    nodes[vs]->dfs();
    for (int i = 0; i < nQuerys; i++) {
      printf(
          "%I64d"
          "\n",
          treeCost - maxEdge[i]);
    }
  }
}
int main() {
  inputGraph();
  solve();
}