##题目大意:
给出一个图,每个点都有点权,每条边都有边权,K次询问使得x到y的(边权+最大点权)最小
##解题思路:
数据比较小,Floyd就可以过
然后稍稍变形就可以了
##源程序:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define min(a,b) a<b?a:b
#define max_3(a,b,c) ((a>b)?(a>c?a:c):(b<c?c:b))
#define inf 1e9
using namespace std;
struct node{
int cost,num;
}c[251];
int f[251][251],dis[251][251],n,m,v,dist[251][251],d[251];
bool cmp(node x,node y){return x.cost<y.cost;}
int main()
{
scanf("%d%d%d",&n,&m,&v);
for (int i=1;i<=n;i++)
scanf("%d",&c[i].cost),c[i].num=i;
sort(c+1,c+n+1,cmp);
for (int i=1;i<=n;i++) d[c[i].num]=i;
memset(dis,0x3f,sizeof(dis));
memset(dist,0x3f,sizeof(dist));
for (int i=1;i<=m;i++)
{
int a,b,e;
scanf("%d%d%d",&a,&b,&e);
dis[d[a]][d[b]]=dis[d[b]][d[a]]=min(dis[d[b]][d[a]],e);
}
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]),
dist[i][j]=min(dist[i][j],dis[i][j]+max_3(c[i].cost,c[j].cost,c[k].cost));
for (int i=1;i<=v;i++)
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",dist[d[x]][d[y]]);
}
}