#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128; 
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
ll read() {
  ll x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2e5+5;

int n,m,ans[N],s[N<<6],tx=1,ty=1;
int cx[N<<6][2],cy[N<<6][2];
ll c[N];
struct opt {ll y; int w;};
vector<opt> p[N<<6];
vector<int> e[N<<6];

void addx(ll x,ll y,int w) {
  int h=topbit(x),u=1;
  rep(i,0,h-1) {
    bool b=x&(1ll<<i);
    if(!cx[u][b]) cx[u][b]=++tx;
    u=cx[u][b];
  }
  rep(b,0,1) {
    if(!cx[u][b]) cx[u][b]=++tx;
    int v=cx[u][b];
    p[v].eb((opt){y,w});
  }
}
void addy(ll y,int w) {
  int h=topbit(y),u=1;
  rep(i,0,h-1) {
    bool b=y&(1ll<<i);
    if(!cy[u][b]) cy[u][b]=++ty;
    u=cy[u][b];
  }
  rep(b,0,1) {
    if(!cy[u][b]) cy[u][b]=++ty;
    int v=cy[u][b]; s[v]+=w;
  }
}
void qryx(ll x,int id) {
  int h=topbit(x),u=1;
  rep(i,0,h) {
    bool b=x&(1ll<<i);
    if(!cx[u][b]) break;
    u=cx[u][b];
  }
  e[u].eb(id);
}
int qryy(ll y) {
  int h=topbit(y),u=1,ans=0;
  rep(i,0,h) {
    bool b=y&(1ll<<i);
    if(!cy[u][b]) break;
    u=cy[u][b], ans+=s[u];
  }
  return ans;
}
void dfs(int u) {
  if(!u) return;
  for(opt f:p[u]) addy(f.y,f.w);
  for(int g:e[u]) ans[g]=qryy(c[g]);
  dfs(cx[u][0]), dfs(cx[u][1]);
  for(opt f:p[u]) addy(f.y,-f.w);
}

signed main() {
  n=read(), m=read();
  rep(i,1,n) {
    ll x=read(), y=read(), val=read();
    addx(x,y,val);
  }
  rep(i,1,m) {
    ll x=read(); c[i]=read();
    qryx(x,i);
  }
  dfs(1);
  rep(i,1,m) printf("%d\n",ans[i]);
  return 0;
}