#include <fstream>

#define NMAX 152
#define TMAX 3501

std::ifstream fin("amenzi.in");
std::ofstream fout("amenzi.out");

struct Edge {
    int node;
    int cost;
};

int n, m;
Edge ad[NMAX][NMAX];

int k;
int ev[NMAX][TMAX];

int p;
int dp[NMAX][TMAX];

inline int max(int x, int y) {
    return x > y ? x : y;
}

int main() {
    int x, y, z;
    fin >> n >> m >> k >> p;

    for (int i = 0; i < m; i++) {
        fin >> x >> y >> z;
        ad[x][++ad[x][0].node] = {y, z};
        ad[y][++ad[y][0].node] = {x, z};
    }

    for (int i = 0; i < k; i++) {
        fin >> x >> y >> z;
        ev[x][y] += z;
    }

    for (int i = 2; i <= n; i++)
        dp[i][0] = -1;

    for (int j = 1; j < TMAX; j++)
        for (int i = 1; i <= n; i++) {
            dp[i][j] = dp[i][j - 1];

            int hi = ad[i][0].node;
            for (int k = 1; k <= hi; k++)
                if (j >= ad[i][k].cost)
                    dp[i][j] = max(dp[i][j], dp[ad[i][k].node][j - ad[i][k].cost]);

            if (dp[i][j] != -1)
                dp[i][j] += ev[i][j];
        }

    for (int i = 0; i < p; i++) {
        fin >> x >> y;
        if (dp[x][y] == -1)
            fout << "-1\n";
        else
            fout << dp[x][y] << '\n';
    }

    fout.close();
    return 0;
}