#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


constexpr Int INF = 1001001001001001001LL;
using Pair = pair<Int, Mint>;
constexpr Pair ZERO(-INF, 0);
Pair update(Pair &t, const Pair &f, Int c) {
  const Int score = f.first + c;
  if (t.first < score) {
    t.first = score;
    t.second = f.second;
  } else if (t.first == score) {
    t.second += f.second;
  }
  return t;
}
Pair update(Pair &t, const Pair &f, const Pair &g) {
  const Int score = f.first + g.first;
  if (t.first < score) {
    t.first = score;
    t.second = f.second * g.second;
  } else if (t.first == score) {
    t.second += f.second * g.second;
  }
  return t;
}


int N, M;
vector<int> W;
vector<Int> C;
vector<int> A, B;
int K, T;

vector<vector<int>> graph, hparg;
vector<int> vis;
vector<int> us;
void dfs(int u) {
  if (vis[u]++) return;
  for (const int v : hparg[u]) dfs(v);
  us.push_back(u);
}


void trans(Pair *t, const Pair *f, int w, Int c) {
  for (int k = 0, kk = w; k < K; ++k, ++kk) {
    if (kk == K) kk = 0;
    update(t[kk], f[k], c);
  }
}
void check(Pair &t, const Pair *f, const Pair *g) {
  for (int k = 0, kk = T; k < K; ++k, --kk) {
    update(t, f[k], g[kk]);
    if (kk == 0) kk = K;
  }
}

vector<Pair> ans;
// f[u]: [src, u]-path, g[u]: [u, snk]-path
Pair f[100'010][110], g[100'010][110];
Pair save[100'010][110];

/*
  f[src, l) OK
  g[r, snk] OK
  p: considered all ways to skip us[l, r)
*/
void rec(int l, int r, Pair p) {
// cerr<<"[rec] "<<l<<" "<<r<<" "<<p<<endl;
  if (l + 1 == r) {
    ans[us[l]] = p;
  } else {
    const int mid = (l + r) / 2;
    {
      Pair pp = p;
      for (int x = r; --x >= mid; ) {
        for (const int y : hparg[x]) if (y < l) check(pp, f[y], g[x]);
      }
      rec(l, mid, pp);
    }
    {
      Pair pp = p;
      for (int x = l; x < mid; ++x) {
        for (const int y : graph[x]) if (r <= y) check(pp, f[x], g[y]);
      }
      rec(mid, r, pp);
    }
  }
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &M);
    W.resize(N);
    C.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d%lld", &W[u], &C[u]);
    }
    A.resize(M);
    B.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    scanf("%d%d", &K, &T);
    
    for (int u = 0; u < N; ++u) {
      W[u] %= K;
    }
    T %= K;
    
    graph.assign(N, {});
    hparg.assign(N, {});
    for (int i = 0; i < M; ++i) {
      graph[A[i]].push_back(B[i]);
      hparg[B[i]].push_back(A[i]);
    }
    vis.assign(N, 0);
    us.clear();
    dfs(N - 1);
// cerr<<"us = "<<us<<endl;
    
    // reindex
    const int usLen = us.size();
    vector<int> ids(N, -1);
    for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
    graph.assign(usLen, {});
    hparg.assign(usLen, {});
    for (int i = 0; i < M; ++i) {
      const int x = ids[A[i]];
      const int y = ids[B[i]];
      if (~x && ~y) {
        graph[x].push_back(y);
        hparg[y].push_back(x);
      }
    }
    
    const int src = ids[0], snk = ids[N - 1];
    assert(~src && ~snk);
    for (int x = 0; x < usLen; ++x) {
      fill(f[x], f[x] + K, ZERO);
      fill(g[x], g[x] + K, ZERO);
    }
    f[src][W[us[src]]] = Pair(C[us[src]], 1);
    for (int x = src; x <= snk; ++x) {
      for (const int y : hparg[x]) trans(f[x], f[y], W[us[x]], C[us[x]]);
    }
    g[snk][W[us[snk]]] = Pair(C[us[snk]], 1);
    for (int x = snk; x >= src; --x) {
      for (const int y : graph[x]) trans(g[x], g[y], W[us[x]], C[us[x]]);
    }
// cerr<<"f[snk] = ";pv(f[snk],f[snk]+K);
// cerr<<"g[src] = ";pv(g[src],g[src]+K);
    ans.assign(N, f[snk][T]);
    rec(src, snk + 1, ZERO);
    
    for (int u = 0; u < N; ++u) {
      if (ans[u].first >= 0) {
        printf("%lld %u\n", ans[u].first, ans[u].second.x);
      } else {
        puts("-1");
      }
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}