// File Name: 2586.cpp

// Author: Zlbing

// Created Time: 2013年08月19日 星期一 10时59分47秒

#pragma comment(linker,"/STACK:102400000,102400000")

#include<iostream>

#include<string>

#include<algorithm>

#include<cstdlib>

#include<cstdio>

#include<set>

#include<map>

#include<vector>

#include<cstring>

#include<stack>

#include<cmath>

#include<queue>

using namespace std;

#define CL(x,v); memset(x,v,sizeof(x));

#define INF 0x3f3f3f3f

#define LL long long

#define REP(i,r,n) for(int i=r;i<=n;i++)

#define RREP(i,n,r) for(int i=n;i>=r;i--)

const int MAXN=4e4+;

struct Edge

{

    int u,v,cost;

    Edge()

    {

    }

    Edge(int u,int v,int cost):u(u),v(v),cost(cost)

    {

    }

};

vector<Edge> edges;

vector<Edge> qedges;

vector<int> G[MAXN],Q[MAXN];

int vis[MAXN];

int dis[MAXN];

int in[MAXN];

int f[MAXN];

int find(int x)

{

    return f[x]==x?x:f[x]=find(f[x]);

}

void LCA(int u,int fa)

{

    for(int i=;i<(int)G[u].size();i++)

    {

        Edge e=edges[G[u][i]];

        if(e.v==fa)continue;

        dis[e.v]=dis[u]+e.cost;

        LCA(e.v,u);

        f[find(e.v)]=u;

    }

    vis[u]=;

    for(int i=;i<(int)Q[u].size();i++)

    {

        Edge& e=qedges[Q[u][i]];

        if(vis[e.v])

        {

            int ancestor=find(e.v);

            qedges[Q[u][i]].cost=dis[e.v]+dis[e.u]-*dis[ancestor];

        }

    }

}

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        int n,m;

        scanf("%d%d",&n,&m);

        REP(i,,n)

        {

            G[i].clear();

            Q[i].clear();

            vis[i]=;

            dis[i]=;

            in[i]=;

            f[i]=i;

        }

        edges.clear();

        qedges.clear();

        int a,b,c;

        REP(i,,n-)

        {

            scanf("%d%d%d",&a,&b,&c);

            in[b]++;

            edges.push_back(Edge(a,b,c));

            edges.push_back(Edge(b,a,c));

            int mm=edges.size();

            G[a].push_back(mm-);

            G[b].push_back(mm-);

        }

        REP(i,,m)

        {

            scanf("%d%d",&a,&b);

            qedges.push_back(Edge(a,b,-));

            qedges.push_back(Edge(b,a,-));

            int mm=qedges.size();

            Q[a].push_back(mm-);

            Q[b].push_back(mm-);

        }

        for(int i=;i<=n;i++)

        {

            if(!in[i])

                LCA(i,-);

        }

        for(int i=;i<(int)qedges.size();i++)

        {

            Edge e=qedges[i];

            if(e.cost!=-)

            {

                printf("%d\n",e.cost);

            }

        }

    }

    return ;

}