#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
using pi = pair <int, int> ;
using ll = long long ;
cs int N = 2e5 + 5, M = 105; 

cs int mod = 1e9 + 7;
int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b; 
}
int dec(int a, int b) {
    return a - b < 0 ? a - b + mod : a - b; 
}
int mul(int a, int b) {
    return 1ll * a * b % mod;
}

int n, w[N], c[N], m, T;
int d[N], K, A; 
vector <int> e[N], re[N];

struct dat {
    ll v;
    int c; 
    dat operator + (cs dat & x) cs {
        if(v < x.v) return x;
        if(v > x.v) return * this; 
        return {v, add(c, x.c)};
    }
    dat operator * (cs dat & x) cs {
        if(v == -1 || x.v == -1) return {-1, 0};
        return {v + x.v, mul(c, x.c)};
    }
}; 
dat dp1[N][M], dp2[N][M];
void trans(dat & x, dat y, int c) {
    if(y.v == -1) return;
    y.v += c; 
    x = x + y; 
}
dat ans[N];

dat mer(dat * a, dat * b) {
    dat sum = {-1, 0}; 
    for(int i = 0; i < K; i++) {
        sum = sum + (a[i] *  b[(A - i + K) % K]); 
    }
    return sum;  
}
namespace sgt {
#define mid ((l + r) >> 1)
cs int N = :: N << 2; 
dat t[N];
void build(int x, int l, int r) {
    t[x] = {-1, 0};
    if(l == r) return; 
    build(x << 1, l, mid);
    build(x << 1 | 1, mid + 1, r);
}
void put(int x, int l, int r, int L, int R, cs dat & v) {
    if(L <= l && r <= R) { t[x] = t[x] + v; return ; }
    if(L <= mid) put(x << 1, l, mid, L, R, v);
    if(R > mid) put(x << 1 | 1, mid + 1, r, L, R, v); 
}
dat qry(int x, int l, int r, int p) {
    if(l == r) return t[x];
    dat ans = t[x];
    if(p <= mid) ans = ans + qry(x << 1, l, mid, p);
    else ans = ans + qry(x << 1 | 1, mid + 1, r, p); 
    return ans; 
}
#undef mid 
}
void Main() {
    cin >> n >> m; 
    for(int i = 1; i <= n; i++) cin >> w[i] >> c[i];
    vector <pi> E(m + 1);
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        e[u].pb(v), ++ d[v];
        re[v].pb(u);
        E[i] = {u, v};
    }
    cin >> K >> A; 
    static int q[N], p[N]; int hd = 1, tl = 0; 
    for(int i = 1; i <= n; i++) if(d[i] == 0) q[++ tl] = i; 
    while(hd <= tl) {
        int x = q[hd ++]; 
        for(int v : e[x]) {
            if((-- d[v]) == 0) q[++ tl] = v;
        }
    }
    for(int i = 0; i <= n; i++)
    for(int j = 0; j < K; j++) dp1[i][j] = dp2[i][j] = {-1, 0};
    for(int i = 1; i <= tl; i++) p[q[i]] = i; 
    dp1[1][w[1] % K] = {c[1], 1};
    for(int i = 1; i <= tl; i++) {
        int x = q[i];
        for(int v : re[x]) {
            for(int j = 0; j < K; j++)
                trans(dp1[x][(j + w[x]) % K], dp1[v][j], c[x]);
        }
    }
    dp2[n][w[n] % K] = {c[n], 1};
    for(int i = tl; i; i--) {
        int x = q[i];
        for(int v : e[x]) {
            for(int j = 0; j < K; j++)
                trans(dp2[x][(j + w[x]) % K], dp2[v][j], c[x]);
        }
    }
    // for(int i =1; i <= tl; i++) {
    //     cout << "FFF " << q[i] <<endl;
    //     int x = q[i];
    //     for(int j = 0; j < K; j++) if(dp1[x][j].v >=0 ) cout << j <<' '<< dp1[x][j].v << ' ' << dp1[x][j].c << '\n';
    // }
    sgt :: build(1, 1, tl);
    for(int i = 1; i <= m; i++) {
        auto [u, v] = E[i];
        if(!p[u] || !p[v]) continue; 
        assert(p[u] <= p[v]);
        if(p[u] + 1 < p[v]) {
            // dat t = mer(dp1[u], dp2[v]);
            // cout << u << ' ' << v << ' ' << t.v << ' ' << t.c << '\n';
            sgt :: put(1, 1, tl, p[u] + 1, p[v] - 1, mer(dp1[u], dp2[v]));
        } 
    }
    for(int i = 1; i <= tl; i++) {
        ans[q[i]] = sgt :: qry(1, 1, tl, i);
    }
    for(int i = 1; i <= tl; i++) {
        if(q[i] == 1) break;
        ans[q[i]] = dp1[n][A];
    }
    for(int i = tl; i; i--) {
        if(q[i] == n) break;
        ans[q[i]] = dp1[n][A];
    }
    for(int i = 1; i <= n; i++) {
        if(ans[i].v == -1) {
            cout << -1 << '\n';
        }
        else {
            cout << ans[i].v << ' ' << ans[i].c << '\n';
        }
    }
    for(int i = 0; i <= n; i++) 
        e[i].clear(), re[i].clear(), q[i] = p[i] = d[i] = 0; 
}

int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> T; 
    while(T--) {
        Main();
    }
    return 0; 
}