#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

using namespace std;

#define maxn 100005

typedef long long LL;

struct Edge{

    int to,next,id;

}edge[maxn<<];

int n,a[maxn],head[maxn],dep[maxn<<],cnt,pos[maxn],dfs_seq[maxn<<],dfn,f[maxn<<][];

int L[maxn],R[maxn],dfs_clock,G[maxn];

LL W[maxn],C[maxn];

inline void add(int u,int v,int id){

    edge[cnt].to=v;

    edge[cnt].next=head[u];

    edge[cnt].id=id;

    head[u]=cnt++;

}

inline int lowbit(int x){return (x)&(-x);}

void init(){

    memset(head,-,sizeof(head));

    memset(pos,-,sizeof(pos));

    memset(C,,sizeof(C));

    cnt=dfn=;

    dfs_clock=;

}

void dfs(int u,int deep)

{

    dfs_seq[dfn]=u,dep[dfn]=deep,pos[u]=dfn++;

    L[u]=++dfs_clock;

    for(int i=head[u];~i;i=edge[i].next){

        int v=edge[i].to;

        if(pos[v]==-){

            G[edge[i].id]=v;                //important

            dfs(v,deep+);

            dfs_seq[dfn]=u,dep[dfn++]=deep;

        }

    }

    R[u]=dfs_clock;

}

void init_RMQ(int n)

{

    for(int i=;i<=n;++i) f[i][]=i;

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

        for(int i=;i+(<<j)-<=n;++i){

            if(dep[f[i][j-]]<dep[f[i+(<<(j-))][j-]]) f[i][j]=f[i][j-];

            else f[i][j]=f[i+(<<(j-))][j-];

        }

}

inline int RMQ(int L,int R)

{

    int k=;

    while(<<(k+)<=R-L+) ++k;

    if(dep[f[L][k]]<dep[f[R-(<<k)+][k]]) return f[L][k];

    return f[R-(<<k)+][k];

}

inline int lca(int u,int v)

{

    if(pos[u]>pos[v]) return dfs_seq[RMQ(pos[v],pos[u])];

    return dfs_seq[RMQ(pos[u],pos[v])];

}

inline void update(int i,LL x)

{

    for(;i<=n;i+=lowbit(i)) C[i]+=x;

}

inline LL sum(int i)

{

    LL s=;

    for(;i>;i-=lowbit(i)) s+=C[i];

    return s;

}

inline LL dist(int u,int v)

{

    return sum(L[u])+sum(L[v])-*sum(L[lca(u,v)]);

}

int main()

{

    #ifndef ONLINE_JUDGE

            freopen("in.txt","r",stdin);

            freopen("out.txt","w",stdout);

    #endif

    int i,u,v,k,q,s,T;

    LL w;

    scanf("%d",&T);

    while(T--){

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

        init();

        for(i=;i<=n-;++i){

            scanf("%d%d%lld",&u,&v,&w);

            add(u,v,i);

            add(v,u,i);

            W[i]=w;

        }

        dfs(,);

        init_RMQ(dfn-);

        int X,Y; LL Z;

        scanf("%d%d%lld",&X,&Y,&Z);               //第n条边

        W[n] = Z;

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

            update(L[G[i]],W[i]);

            update(R[G[i]]+,-W[i]);

        }

        while(q--){

            scanf("%d",&k);

            if(k==){

                scanf("%d%lld",&u,&w);

                if(u==n)

                    W[n] = w;

                else{

                    update(L[G[u]],w-W[u]);

                    update(R[G[u]]+,-w+W[u]);

                    W[u]=w;

                }

            }

            else{

                scanf("%d%d",&u,&v);

                LL ans=dist(u,v);

                ans=min(ans,dist(u,X)+dist(v,X));

                ans=min(ans,dist(u,Y)+dist(v,Y));

                ans=min(ans,dist(u,X)+dist(v,Y)+Z);

                ans=min(ans,dist(u,Y)+dist(v,X)+Z);

                printf("%lld\n",ans);

            }

        }

    }

    return ;

}