hdu2586

/*

source：http://acm.hdu.edu.cn/showproblem.php?pid=2586 

title:  How far away ？

Tarjan算法查询两个点的LCA（最近公共祖先）
 */
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
const int N = 40005;
const int QN = 205;
typedef pair<int, int> pii;
#define mkpii make_pair<int, int>
struct e{
int v;
e* nxt;
int len;
}es[N<<1], *fir[N];


int n, en, qn;
pii qs[QN];
vector<pii> qlca[N];
e stk[N];  //用于模拟dfs的数据结构
int par[N], fa[N], anc[QN]; //par[i]为i的直接前驱, fa用于并查集, anc[i]为第i次查询的结果
int dist[N]; //dist[i]表示i到根节点的距离
bool vis[N]; //标记节点是否已经访问
inline void add_e(int u, int v, int len){
es[en].v = v; es[en].nxt = fir[u]; es[en].len = len; fir[u] = &es[en++];
}
bool input(){
scanf("%d%d", &n, &qn);
int u, v, i;
for(i = 1; i <= n; i++) fir[i] = NULL;
en = 0;
for(i = 1; i < n; i++){
int len;
scanf("%d%d%d", &u, &v, &len);
add_e(u, v, len);
add_e(v, u, len);
}
for(i = 0; i < qn; i++){
scanf("%d%d", &qs[i].first, &qs[i].second);
}
return true;
}


//向栈里添加节点u
void push(int u, int p, int len, int& top){
top++;
stk[top].v = u;
stk[top].nxt = fir[u];
par[u] = p;
fa[u] = u;
dist[u] = len;
vis[u] = true;
}
int findFa(int u){
int k = u;
while(k != fa[k]) k = fa[k];
while(u != k){
int tf = fa[u];
fa[u] = k;
u = tf;
}
return k;
}
void lca(pii* qs, int qn, int* anc){
int i, r, u, v, top;
for(i = 1; i <= n; i++){
qlca[i].clear();
vis[i] = false;
}
for(i = 0; i < qn; i++){
//这里的pii的first表示第几个查询,second表示另一个点
qlca[qs[i].first].push_back(mkpii(i, qs[i].second));
qlca[qs[i].second].push_back(mkpii(i, qs[i].first));
if(qs[i].first == qs[i].second){
anc[i] = qs[i].first;
}
}
r = 1;
top = -1;
push(r, -1, 0, top);
while(top >= 0){
u = stk[top].v;
if(!stk[top].nxt){ //u为根的子树已经访问完毕
if(par[u] >= 0){
fa[u] = par[u];
}
top--;
continue;
}
v = stk[top].nxt->v;
int tl = stk[top].nxt->len;
stk[top].nxt = stk[top].nxt->nxt;
if(v != par[u]){
push(v, u, dist[u] + tl, top);
//处理查询
int size = qlca[v].size();
for(i = 0; i < size; i++){
int k = qlca[v][i].second;
if(v != k){
anc[qlca[v][i].first] = findFa(k);
}
}
}
}
}
void solve(){
lca(qs, qn, anc);
typedef long long ll;
for(int i = 0; i < qn; i++){
int a = anc[i];
ll ans = (ll) dist[qs[i].first] + dist[qs[i].second] - (ll)2*dist[a];
cout <<ans<<endl;
}
}
int main() {
int t;
scanf("%d", &t);
while(t--){
input();
solve();
}
return 0;
}