Problem: In one kingdom there are n cities and m two-way roads. Each road connects a pair of cities, and for each road we know the level of drivers dissatisfaction — the value wi.

For each road we know the value ci — how many lamziks we should spend to reduce the level of dissatisfaction with this road by one. Thus, to reduce the dissatisfaction with the i-th road by k, we should spend k·ci lamziks. And it is allowed for the dissatisfaction to become zero or even negative.

In accordance with the king's order, we need to choose n - 1 roads and make them the main roads. An important condition must hold: it should be possible to travel from any city to any other by the main roads.

The road ministry has a budget of S lamziks for the reform. The ministry is going to spend this budget for repair of some roads (to reduce the dissatisfaction with them), and then to choose the n - 1 main roads.

Help to spend the budget in such a way and then to choose the main roads so that the total dissatisfaction with the main roads will be as small as possible. The dissatisfaction with some roads can become negative. It is not necessary to spend whole budget S.

It is guaranteed that it is possible to travel from any city to any other using existing roads. Each road in the kingdom is a two-way road.

Input

The first line contains two integers n and m (2 ≤ n ≤ 2·105, n - 1 ≤ m ≤ 2·105) — the number of cities and the number of roads in the kingdom, respectively.

The second line contains m integers w1, w2, ..., wm (1 ≤ wi ≤ 109), where wi is the drivers dissatisfaction with the i-th road.

The third line contains m integers c1, c2, ..., cm (1 ≤ ci ≤ 109), where ci is the cost (in lamziks) of reducing the dissatisfaction with the i-th road by one.

The next m lines contain the description of the roads. The i-th of this lines contain a pair of integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi) which mean that the i-th road connects cities ai and bi. All roads are two-way oriented so it is possible to move by the i-th road from ai to bi, and vice versa. It is allowed that a pair of cities is connected by more than one road. 

The last line contains one integer S (0 ≤ S ≤ 109) — the number of lamziks which we can spend for reforms. 

Output

In the first line print K — the minimum possible total dissatisfaction with main roads.

In each of the next n - 1 lines print two integers x, vx, which mean that the road x is among main roads and the road x, after the reform, has the level of dissatisfaction vx.

Consider that roads are numbered from 1 to m in the order as they are given in the input data. The edges can be printed in arbitrary order. If there are several answers, print any of them. 

Examples

Input

6 9
1 3 1 1 3 1 2 2 2
4 1 4 2 2 5 3 1 6
1 2
1 3
2 3
2 4
2 5
3 5
3 6
4 5
5 6
7


Output

0
1 1
3 1
6 1
7 2
8 -5


Input

3 3
9 5 1
7 7 2
2 1
3 1
3 2
2


Output

5
3 0
2 5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int maxn = 2e5 + 10;
using namespace std;
long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); }
long long qpow(long long p, long long q) {
  long long f = 1;
  while (q) {
    if (q & 1) f = f * p;
    p = p * p;
    q >>= 1;
  }
  return f;
}
inline long long read() {
  long long x = 0;
  int f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, m, k, t, fa[20][maxn], dep[maxn], w[maxn], c[maxn], ok[maxn], pq[maxn],
    u[maxn], v[maxn], p[maxn], s;
vector<int> ans;
vector<pair<int, int> > e[maxn];
pair<int, int> ex, ey, st[20][maxn];
long long sum, best;
int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }
void dfs(int p) {
  for (int i = 1; fa[i - 1][p]; i++) {
    fa[i][p] = fa[i - 1][fa[i - 1][p]];
    st[i][p] = max(st[i - 1][p], st[i - 1][fa[i - 1][p]]);
  }
  for (pair<int, int> x : e[p]) {
    int to = x.first, q = x.second;
    if (to == fa[0][p]) continue;
    dep[to] = dep[p] + 1;
    fa[0][to] = p;
    st[0][to] = make_pair(w[q], q);
    dfs(to);
  }
}
pair<int, int> max_lca(int a, int b) {
  pair<int, int> ma = make_pair(0, 0);
  if (dep[a] < dep[b]) swap(a, b);
  for (int i = 19; i >= 0; i--)
    if (dep[fa[i][a]] >= dep[b]) ma = max(ma, st[i][a]), a = fa[i][a];
  if (a == b) return ma;
  for (int i = 19; i >= 0; i--) {
    if (fa[i][a] != fa[i][b]) {
      ma = max(ma, st[i][a]);
      ma = max(ma, st[i][b]);
      a = fa[i][a];
      b = fa[i][b];
    }
  }
  ma = max(ma, st[0][a]);
  ma = max(ma, st[0][b]);
  return ma;
}
int main() {
  int i, j;
  n = read(), m = read();
  for (i = 1; i <= m; i++) w[i] = read();
  for (i = 1; i <= m; i++) c[i] = read();
  for (i = 1; i <= m; i++) u[i] = read(), v[i] = read(), pq[i] = i;
  scanf("%d", &s);
  sort(pq + 1, pq + m + 1,
       [](const int& x, const int& y) { return w[x] < w[y]; });
  for (i = 1; i <= n; i++) p[i] = i;
  ex = make_pair(0x3f3f3f3f, 0x3f3f3f3f);
  for (i = 1; i <= m; i++) {
    int x = find(u[pq[i]]), y = find(v[pq[i]]);
    if (x != y) {
      p[x] = y;
      sum += w[pq[i]];
      ex = min(ex, make_pair(c[pq[i]], pq[i]));
      ans.push_back(pq[i]);
      e[u[pq[i]]].push_back(make_pair(v[pq[i]], pq[i]));
      e[v[pq[i]]].push_back(make_pair(u[pq[i]], pq[i]));
    } else
      ok[pq[i]] = 1;
  }
  dfs(1);
  best = sum - s / ex.first;
  for (i = 1; i <= m; i++) {
    if (ok[i]) {
      long long now = sum;
      pair<int, int> better = max_lca(u[i], v[i]);
      now -= better.first;
      now += w[i] - s / c[i];
      if (now < best) {
        best = now;
        ex = better;
        ey = make_pair(c[i], i);
      }
    }
  }
  printf("%I64d\n", best);
  for (int x : ans) {
    if (x == ex.second) {
      if (!ey.second) printf("%d %d\n", x, w[x] - s / c[x]);
    } else
      printf("%d %d\n", x, w[x]);
  }
  if (ey.first) printf("%d %d\n", ey.second, w[ey.second] - s / c[ey.second]);
  return 0;
}