#include<cstdio>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

#include<vector>

using namespace std;

struct node

{

    int x,y,d,next;

}a[],e[];int len,last[],elen,elast[];

void ins(int x,int y,int d)

{

    len++;

    a[len].x=x;a[len].y=y;a[len].d=d;

    a[len].next=last[x];last[x]=len;

}

void eins(int x,int y,int d)

{

    elen++;

    e[elen].x=x;e[elen].y=y;e[elen].d=d;

    e[elen].next=elast[x];elast[x]=elen;

}

bool edg[];int cnt,bel[],sum[],ts[];

int fa[],dep[],dis[];

int tp,id[],sdis[];

void DP(int rt,int bac)

{

    tp=dep[bac]-dep[rt]+;

    for(int i=;i<=tp;i++) id[tp-i+]=bac, bac=fa[bac];

    sdis[]=;

    for(int i=;i<=tp;i++)

    {

        sdis[i]=sdis[i-]+dis[id[i]];

        ts[id[i]]=sdis[i];

    }

    cnt++;sum[cnt]=sdis[tp]+dis[rt];

    for(int i=;i<=tp;i++)

    {

        ins(rt,id[i],min(sdis[i],sum[cnt]-sdis[i]));

        edg[id[i]]=true;

        bel[id[i]]=cnt;

    }

}

int z,dfn[],low[];

void cactus(int x)

{

    dfn[x]=low[x]=++z;

    for(int k=elast[x];k;k=e[k].next)

    {

        int y=e[k].y;

        if(dfn[y]==)

        {

            fa[y]=x;

            dep[y]=dep[x]+;

            dis[y]=e[k].d;

            cactus(y);

            low[x]=min(low[x],low[y]);

        }

        else if(y!=fa[x])

            low[x]=min(low[x],dfn[y]);

    }

    for(int k=elast[x];k;k=e[k].next)

    {

        int y=e[k].y;

        if(fa[y]!=x&&dfn[x]<dfn[y])

        {

            int t=dis[x];

            dis[x]=e[k].d;

            DP(x,y);

            dis[x]=t;

        }

    }

}

//-----------------------------------------

int Bin[];

int f[][];

void dfs(int x)

{

    for(int i=;dep[x]>=Bin[i];i++)f[i][x]=f[i-][f[i-][x]];

    for(int k=last[x];k;k=a[k].next)

    {

        int y=a[k].y;

        if(y!=f[][x])

        {

            f[][y]=x;

            dep[y]=dep[x]+;

            dis[y]=dis[x]+a[k].d;

            dfs(y);

        }

    }

}

int LCA(int x,int y,int &fx,int &fy)

{

    int w=-;

    if(dep[x]<dep[y]){swap(x,y);w=;}

    for(int i=;i>=;i--)

        if(dep[x]-dep[y]>=Bin[i])x=f[i][x];

    if(x==y){fx=-;return x;}

    for(int i=;i>=;i--)

        if(dep[x]>=Bin[i]&&f[i][x]!=f[i][y])x=f[i][x],y=f[i][y];

    if(w==-)fx=x,fy=y;

    else fx=y,fy=x;

    return f[][x];

}

//--------------get_LCA----------------------------

int main()

{

    int n,m,Q,x,y,dd;

    scanf("%d%d%d",&n,&m,&Q);

    len=;memset(last,,sizeof(last));

    elen=;memset(elast,,sizeof(elast));

    for(int i=;i<=m;i++)

    {

        scanf("%d%d%d",&x,&y,&dd);

        eins(x,y,dd);eins(y,x,dd);

    }

    z=cnt=;

    memset(dfn,,sizeof(dfn));

    memset(low,,sizeof(low));

    memset(edg,false,sizeof(edg));

    fa[]=,dep[]=,cactus();

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

        if(edg[i]==false)

            ins(fa[i],i,dis[i]);

    Bin[]=;for(int i=;i<=;i++)Bin[i]=Bin[i-]*;

    f[][]=;dep[]=;dis[]=;dfs();

    while(Q--)

    {

        scanf("%d%d",&x,&y);

        int fx,fy,lca=LCA(x,y,fx,fy);

        if(fx!=-&&bel[fx]!=&&bel[fx]==bel[fy])

        {

            dd=abs(ts[fx]-ts[fy]);

            printf("%d\n",dis[x]-dis[fx]+dis[y]-dis[fy]+min(dd,sum[bel[fx]]-dd));

        }

        else

            printf("%d\n",dis[x]+dis[y]-*dis[lca]);

    }

    return ;

}