https://nanti.jisuanke.com/t/41305
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=6e2+9;
const int mod=1e9+7;
int d[maxn];
bool vis[maxn];
int head[maxn];
int tot;
int n,m;
struct E
{
int to,cost,nex;
}edge[maxn*3];
struct node
{
int to,cost;
node(){}
node(int _to,int _cost)
{
to=_to;
cost=_cost;
}
bool operator < (const node &b) const
{
return cost>b.cost;
}
};
void addedge(int u,int v,int w)
{
edge[tot].to=v;
edge[tot].cost=w;
edge[tot].nex=head[u];
head[u]=tot++;
}
void init()
{
mem(head,-1);
tot=0;
}
bool spfa(int s)
{
queue<int>q;
for(int i=0;i<=n;i++) vis[i]=0,d[i]=INF;
d[s]=0;
vis[s]=1;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];i!=-1;i=edge[i].nex)
{
int v=edge[i].to;
int w=edge[i].cost;
if(d[v]>d[u]+w)
{
d[v]=d[u]+w;
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
}
}
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int T;
cin>>T;
while(T--)
{
init();
cin>>n>>m;
for(int i=0;i<m;i++)
{
int u,v,w;
cin>>u>>v>>w;
u++;
v++;
addedge(u,v,w);
}
for(int i=1;i<=6;i++)
{
int u,v;
cin>>u>>v;
u++;
v++;
spfa(v);
cout<<-d[u]<<endl;
addedge(u,v,-d[u]);
}
}
return 0;
}