#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define int long long
using namespace std;
typedef long long LL;
const int N = 1e5 + 10,INF = INT_MAX;
int n,q;
struct Node
{
    int x,y,w;
    bool operator<(const Node &W) const
    {
        return w<W.w;
    }
}P[N];
//a:x+y,b:x-y,c:-x+y,d:-x-y
int a[N],b[N],c[N],d[N];

void solve()
{
    cin>>n>>q;
    for(int i=1;i<=n;i++) cin>>P[i].x>>P[i].y>>P[i].w;
    sort(P+1,P+n+1);
    a[n+1] = b[n+1] = c[n+1] = d[n+1] = -INF;
    for(int i=n;i;i--)
    {
        a[i] = max(a[i+1],P[i].x+P[i].y);
        b[i] = max(b[i+1],P[i].x-P[i].y);
        c[i] = max(c[i+1],-P[i].x+P[i].y);
        d[i] = max(d[i+1],-P[i].x-P[i].y);
    }
    while(q--)
    {
        int x,y;cin>>x>>y;
        int l = 1,r = n,ans = 0;
        while(l<r)
        {
            int mid = l + r + 1 >> 1;
            int res = max(max(-x-y+a[mid],-x+y+b[mid]),max(x-y+c[mid],x+y+d[mid]));
            if(P[mid].w<res) l = mid;
            else 
            {
                r = mid - 1;
                ans = max(ans,res);
            }
        }
        int res = max(max(-x-y+a[l],-x+y+b[l]),max(x-y+c[l],x+y+d[l]));
        if(P[l].w<res) ans = max(ans,P[l].w);
        else ans = max(ans,res);
        cout<<ans<<"\n";
    }
}

signed main()
{
    ios;
    int T;cin>>T;
    while(T--) solve();
    return 0;
}