#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
#define true ture
#define false flase
using namespace std;
#define ll long long
#define inf 0xfffffff
int scan()
{
    int res = 0 , ch ;
    while( !( ( ch = getchar() ) >= ‘0‘ && ch <= ‘9‘ ) )
    {
        if( ch == EOF )  return 1 << 30 ;
    }
    res = ch - ‘0‘ ;
    while( ( ch = getchar() ) >= ‘0‘ && ch <= ‘9‘ )
        res = res * 10 + ( ch - ‘0‘ ) ;
    return res ;
}
#define maxn 100010
#define M 22
int father[maxn];
struct is
{
    int v,next,w;
} edge[maxn*2];
int deep[maxn],jiedge;
int dis[maxn];
int head[maxn];
int fa[maxn][M];
int findd(int x)
{
    return x==father[x]?x:father[x]=findd(father[x]);
}
int hebing(int u,int v)
{
    int x=findd(u);
    int y=findd(v);
    if(x!=y)
    father[x]=y;
}
void add(int u,int v,int w)
{
    jiedge++;
    edge[jiedge].v=v;
    edge[jiedge].w=w;
    edge[jiedge].next=head[u];
    head[u]=jiedge;
}
void dfs(int u)
{
    for(int i=head[u]; i; i=edge[i].next)
    {
        int v=edge[i].v;
        int w=edge[i].w;
        if(!deep[v])
        {
            dis[v]=dis[u]+edge[i].w;
            deep[v]=deep[u]+1;
            fa[v][0]=u;
            dfs(v);
        }
    }
}
void st(int n)
{
    for(int j=1; j<M; j++)
        for(int i=1; i<=n; i++)
            fa[i][j]=fa[fa[i][j-1]][j-1];
}
int LCA(int u , int v)
{
    if(deep[u] < deep[v]) swap(u , v) ;
    int d = deep[u] - deep[v] ;
    int i ;
    for(i = 0 ; i < M ; i ++)
    {
        if( (1 << i) & d )  // 注意此处，动手模拟一下，就会明白的
        {
            u = fa[u][i] ;
        }
    }
    if(u == v) return u ;
    for(i = M - 1 ; i >= 0 ; i --)
    {
        if(fa[u][i] != fa[v][i])
        {
            u = fa[u][i] ;
            v = fa[v][i] ;
        }
    }
    u = fa[u][0] ;
    return u ;
}
void init(int n)
{
    for(int i=1;i<=n;i++)
    father[i]=i;
    memset(head,0,sizeof(head));
    memset(fa,0,sizeof(fa));
    memset(deep,0,sizeof(deep));
    jiedge=0;
}
int main()
{
    int x,n,t;
    while(~scanf("%d%d%d",&n,&x,&t))
    {
        init(n);
        for(int i=0; i<x; i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            add(u,v,w);
            add(v,u,w);
            hebing(u,v);
        }
        for(int i=1;i<=n;i++)
        if(!deep[i])
        {
            deep[i]=1;
            dis[i]=0;
            dfs(i);
        }
        st(n);
        while(t--)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            if(findd(a)!=findd(b))
            printf("Not connected\n");
            else
            printf("%d\n",dis[a]-2*dis[LCA(a,b)]+dis[b]);
        }
    }
    return 0;
}