#include<bits/stdc++.h>
#define int long long
#define MULT_TEST 1
using namespace std;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, q;
    n = read(); q = read();
    vector<array<int, 3>> E;
    vector<array<int, 4>> maxn(n + 2);
    E.push_back({0, 0, 0});
    for (int i = 1; i <= n; i++) {
        int x = read(), y = read(), w = read();
        E.push_back({w, x, y});
    }
    sort(E.begin(), E.end());
    maxn[n + 1][0] = maxn[n + 1][1] = maxn[n + 1][2] = maxn[n + 1][3] = -INF;
    for (int i = n; i >= 1; i--) {
        maxn[i][0] = max(maxn[i + 1][0], - E[i][1] - E[i][2]);
        maxn[i][1] = max(maxn[i + 1][1], E[i][1] - E[i][2]);
        maxn[i][2] = max(maxn[i + 1][2], E[i][1] + E[i][2]);
        maxn[i][3] = max(maxn[i + 1][3], - E[i][1] + E[i][2]);
    }
    while (q--) {
        int tx = read(), ty = read();
        int l = 1, r = n, ans = 0;
        auto Calc = [&](int x) {
            int m1 = max(tx + ty + maxn[x][0], tx - ty + maxn[x][3]);
            int m2 = max(- tx + ty + maxn[x][1], - tx - ty + maxn[x][2]);
            return max(m1, m2);
        };
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (E[mid][0] < Calc(mid)) ans = max(ans, E[mid][0]), l = mid + 1;
            else ans = max(ans, Calc(mid)), r = mid - 1;
        }
        printf("%lld\n", ans);
    }
}
signed main() {
    int T = 1;
#if MULT_TEST
    T = read();
#endif 
    while (T--) Solve();
    return 0;
}