#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#define LL long long
using namespace std;
vector<int>v[50005];
int N,C,b[50005],r[50005];
LL a[50005],res,dp[50005][4][2];
bool vis[50005][4][2];
void root(int x)
{for (int i=0; i<v[x].size(); ++i)if (v[x][i]!=r[x]){r[v[x][i]]=x;root(v[x][i]);}
}LL dfs(int x,int y,int z);void update(int x)
{vector<LL>ls[4],rs[4],e[4];if (v[x].size()==1 && x){if (!b[x]) res=max(res,a[x]);else if (C) res=max(res,a[x]);}else if ((!x && v[x].size()==1) || (x && v[x].size()==2))return;else if (!b[x]){for (int j=0; j<4; ++j)for (int i=0; i<v[x].size(); ++i)if (v[x][i]!=r[x]){if (dfs(v[x][i],j,0)){ls[j].push_back(dfs(v[x][i],j,0)+a[x]);rs[j].push_back(dfs(v[x][i],j,0)+a[x]);}else{ls[j].push_back(dfs(v[x][i],j,0));rs[j].push_back(dfs(v[x][i],j,0));}if (dfs(v[x][i],j,1))e[j].push_back(dfs(v[x][i],j,1)+a[x]);elsee[j].push_back(dfs(v[x][i],j,1));}for (int j=0; j<4; ++j){LL now=ls[j][0];for (int i=1; i<ls[j].size(); ++i)if (ls[j][i]){if (ls[j][i]>now) now=ls[j][i];else ls[j][i]=now;}now=rs[j][rs[j].size()-1];for (int i=ls[j].size()-2; i>=0; --i)if (rs[j][i]){if (rs[j][i]>now) now=rs[j][i];else rs[j][i]=now;}}for (int i=0; i<=C; ++i)for (int k=0; k<e[i].size(); ++k)for (int j=0; j<=C-i; ++j)if (e[i][k] && ((k && ls[j][k-1]) || (k<rs[j].size()-1 && rs[j][k+1]))){if (C && j==C) continue;LL u=0;if (k) u=max(u,ls[j][k-1]);if (k<rs[j].size()-1) u=max(u,rs[j][k+1]);res=max(res,u+e[i][k]-a[x]);}}else{for (int j=0; j<4; ++j)for (int i=0; i<v[x].size(); ++i)if (v[x][i]!=r[x]){if (dfs(v[x][i],j,0)){ls[j].push_back(dfs(v[x][i],j,0)+a[x]);rs[j].push_back(dfs(v[x][i],j,0)+a[x]);}else{ls[j].push_back(dfs(v[x][i],j,0));rs[j].push_back(dfs(v[x][i],j,0));}if (dfs(v[x][i],j,1))e[j].push_back(dfs(v[x][i],j,1)+a[x]);elsee[j].push_back(dfs(v[x][i],j,1));}for (int j=0; j<4; ++j){LL now=ls[j][0];for (int i=1; i<ls[j].size(); ++i)if (ls[j][i]){if (ls[j][i]>now) now=ls[j][i];else ls[j][i]=now;}now=rs[j][rs[j].size()-1];for (int i=ls[j].size()-2; i>=0; --i)if (rs[j][i]){if (rs[j][i]>now) now=rs[j][i];else rs[j][i]=now;}}for (int i=0; i<C; ++i)for (int k=0; k<e[i].size(); ++k)for (int j=0; j<=C-i-1; ++j)if (e[i][k] && ((k && ls[j][k-1]) || (k<rs[j].size()-1 && rs[j][k+1]))){if (j==C-1) continue;LL u=0;if (k) u=max(u,ls[j][k-1]);if (k<rs[j].size()-1) u=max(u,rs[j][k+1]);res=max(res,u+e[i][k]-a[x]);}}
}int main()
{int T;
//    freopen("1006.in","r",stdin);
//    freopen("out.txt","w",stdout);scanf("%d",&T);while (T--){int x,y;scanf("%d%d",&N,&C);for (int i=0; i<N; ++i) scanf("%I64d%d",&a[i],&b[i]);for (int i=0; i<N; ++i) v[i].clear();for (int i=1; i<N; ++i){scanf("%d%d",&x,&y);v[x].push_back(y);v[y].push_back(x);}r[0]=-1;root(0);res=0;memset(vis,0,sizeof(vis));dfs(0,0,0);/*for (int i=0; i<N; ++i)for (int j=0; j<4; ++j)for (int k=0; k<2; ++k)printf("dp[%d][%d][%d]=%lld\n",i,j,k,dp[i][j][k]);*/printf("%I64d\n",res);}return 0;
}LL dfs(int x,int y,int z)
{if (vis[x][y][z]) return dp[x][y][z];for (int i=0; i<4; ++i)for (int j=0; j<2; ++j){vis[x][i][j]=true;dp[x][i][j]=0;}if (v[x].size()==1 && x){if (!b[x])dp[x][0][0]=dp[x][0][1]=a[x];elsedp[x][1][0]=dp[x][1][1]=a[x];}else if (!b[x]){for (int i=0; i<v[x].size(); ++i)if (v[x][i]!=r[x])for (int j=0; j<4; ++j){dp[x][j][0]=max(dp[x][j][0],dfs(v[x][i],j,0));dp[x][j][1]=max(dp[x][j][1],dfs(v[x][i],j,1));}for (int i=0; i<4; ++i)for (int j=0; j<2; ++j)if (dp[x][i][j])dp[x][i][j]+=a[x];}else{for (int i=0; i<v[x].size(); ++i)if (v[x][i]!=r[x])for (int j=1; j<4; ++j){dp[x][j][0]=max(dp[x][j][0],dfs(v[x][i],j-1,0));dp[x][j][1]=max(dp[x][j][1],dfs(v[x][i],j-1,1));}for (int i=1; i<4; ++i)for (int j=0; j<2; ++j)if (dp[x][i][j])dp[x][i][j]+=a[x];dp[x][1][1]=a[x];if (!dp[x][1][0]) dp[x][1][0]=a[x];}update(x);if (!b[x]){for (int i=0; i<C; ++i)res=max(res,dp[x][i][0]);for (int i=0;i<=C;++i)res=max(res,dp[x][i][1]);}else{for (int i=1;i<=C;++i)res=max(res,dp[x][i][0]);for (int i=1;i<=C;++i)res=max(res,dp[x][i][1]);}return dp[x][y][z];
}