#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
	ll x,w;
	node(ll nx=0,ll nw=0){x=nx;w=nw;}
};
vector<node>se[2005];
vector<int>s[2005];
ll dep[2005][2005],mx[2005];
int depi[2005][2005],vis[2005];
int dfn[2005][2005],ed[2005][2005];
int f[2005][12][2005],fr[2005];
int n,q,st,k,t,cnt=0,rt,c;
ll sum=0,ans=0;
int fa(int a,int b)
{
	if(depi[rt][a]>depi[rt][b])swap(a,b);
	for(int i=11;i>=0;i--)if(depi[rt][f[rt][i][b]]>=depi[rt][a])b=f[rt][i][b];
	if(a==b)return a;
	for(int i=11;i>=0;i--)if(f[rt][i][a]!=f[rt][i][b])a=f[rt][i][a],b=f[rt][i][b];
	return f[rt][0][a];
}
void dfs(int p,int ff)
{
	f[rt][0][p]=ff;
	dfn[rt][p]=ed[rt][p]=++cnt;
	for(int i=0;i<se[p].size();i++)
	{
		node v=se[p][i];
		if(v.x==ff)continue;
		dep[rt][v.x]=dep[rt][p]+v.w;
		depi[rt][v.x]=depi[rt][p]+1;
		dfs(v.x,p);
		ed[rt][p]=ed[rt][v.x];
	}
}
void dfs2(int p,int ff)
{
	fr[p]=fr[ff];
	if(vis[p])fr[p]=p;
	if(fr[p]==0)ans=min(ans,sum-dep[rt][p]);
	else
	{
		ans=min(ans,sum-dep[rt][p]+2*(dep[rt][fr[p]]-dep[rt][c]));
	}
	for(int i=0;i<s[p].size();i++)
		{
			int v=s[p][i];
			if(v==ff)continue;
			//dep[rt][v.x]=dep[rt][p]+v.w;
			//depi[rt][v.x]=depi[rt][p]+1;
			dfs2(v,p);
			//ed[rt][p]=ed[rt][v.x];
		}
}
int main()
{
	scanf("%d%d",&n,&q);
	for(int i=1;i<n;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		sum+=z;
		se[x].push_back(node(y,z));
		se[y].push_back(node(x,z));
		s[x].push_back(y);
		s[y].push_back(x);
	}
	sum=2ll*sum;
	for(int i=1;i<=n;i++)
	{
		cnt=0;rt=i;
		dep[i][i]=0;
		depi[i][i]=0;
		//f[i][0][i]=i;
		dfs(i,i);
		for(int j=1;j<12;j++)for(int k=1;k<=n;k++)f[i][j][k]=f[i][j-1][f[i][j-1][k]];
		for(int j=1;j<=n;j++)mx[rt]=max(mx[rt],dep[rt][j]);
	}
	for(int i=1;i<=q;i++)
	{
		scanf("%d%d%d",&st,&k,&t);
		rt=st;
		c=fa(k,t);
		if(c==k)printf("%lld\n",sum-mx[st]);
		else if(c==t)printf("impossible\n");
		else
		{
			memset(vis,0,sizeof(vis));
			for(int j=k;j!=c;j=f[rt][0][j])vis[j]=1;
			ans=sum;
			fr[st]=0;
			dfs2(rt,0);
			printf("%lld\n",ans);
		}
	}
	return 0;
}