#include<bits/stdc++.h>
using namespace std;
#define il inline
#define lf double
#define gc getchar()
#define t(i) edge[i].to
#define n(i) edge[i].nxt
#define w(i) edge[i].wei
#define ri register int
#define rb register bool
#define rc register char
#define rp(i,x,y) for(ri i=x;i<=y;++i)
#define my(i,x,y) for(ri i=x;i>=y;--i)
#define e(i,x) for(ri i=head[x];~i;i=n(i))const int N=200000+10;
const lf eps=1e-5,inf=1e7;
int S,T,ed_cnt=-1,head[N],cur[N],dep[N],n,m,st_cnt,s[N];
lf l,r,sum,a[N],st[N];
struct ed{int to,nxt;lf wei;}edge[N<<2];
struct node{int p,r;lf d;}nod[N];il int read()
{rc ch=gc;ri x=0;rb y=1;while(ch!='-' && (ch>'9' || ch<'0'))ch=gc;if(ch=='-')ch=gc,y=0;while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^'0'),ch=gc;return y?x:-x;
}
il bool cmp(ri x,ri y){return x>y;}
il int name(ri x,ri y){return n+(x-1)*st_cnt+y;}
il void ad(ri x,ri y,lf z)
{edge[++ed_cnt]=(ed){x,head[y],z};head[y]=ed_cnt;edge[++ed_cnt]=(ed){y,head[x],(lf)0};head[x]=ed_cnt;}
il bool bfs()
{queue<int>Q;Q.push(S);memset(dep,0,sizeof(dep));dep[S]=1;while(!Q.empty()){ri nw=Q.front();Q.pop();e(i,nw)if(w(i)-eps>0 && !dep[t(i)])dep[t(i)]=dep[nw]+1,Q.push(t(i));}return dep[T];
}
il lf dfs(ri nw,lf flow)
{if(nw==T || !flow)return flow;lf ret=0;for(ri &i=cur[nw];~i;i=n(i))if(w(i) && dep[t(i)]==dep[nw]+1){lf tmp=dfs(t(i),min(flow,w(i)));ret+=tmp,w(i)-=tmp;w(i^1)+=tmp,flow-=tmp;}return ret;
}
il lf dinic(){lf ret=0;while(bfs()){rp(i,S,T)cur[i]=head[i];while(lf d=dfs(S,inf))ret+=d;}return ret;}
il bool check(lf t)
{memset(head,-1,sizeof(head));ed_cnt=-1,st_cnt=0;memset(a,0,sizeof(a));rp(i,1,n)nod[i].d+=t,st[++st_cnt]=nod[i].r,st[++st_cnt]=nod[i].d;sort(st+1,st+1+st_cnt);st_cnt=unique(st+1,st+st_cnt+1)-st-2;rp(i,1,n)ad(T,i,nod[i].p);rp(i,1,m)rp(j,1,st_cnt){rp(k,1,n)if(nod[k].r<=st[j] && st[j+1]<=nod[k].d)ad(k,name(i,j),(lf)s[i]*(st[j+1]-st[j]));ad(name(i,j),S,s[i]*i*(st[j+1]-st[j]));}lf tmp=dinic();rp(i,1,n)nod[i].d-=t;return sum-tmp<eps;
}int main()
{
//    freopen("2570.in","r",stdin);freopen("2570.out","w",stdout);ri K=read();while(K--){ed_cnt=-1;l=0;sum=0;n=read();m=read();S=0;T=n*10+m*10;rp(i,1,n)nod[i]=(node){read(),read(),(lf)read()},sum+=nod[i].p;rp(i,1,m)s[i]=read();ri tmp=s[1];sort(s+1,s+1+m,cmp);s[m+1]=0;rp(i,1,m)s[i]=s[i]-s[i+1];l=0;r=sum/tmp;while(r-l>eps){lf mid=(l+r)/2;if(check(mid))r=mid;else l=mid;}
//        printf("%.6lf\n",r);}return 0;
}