3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
char buffer[100001], *S, *T;
inline char read_char() {
  if (S == T) {
    T = (S = buffer) + fread(buffer, 1, 100001, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
inline int read_int() {
  int s = 0;
  bool flag = false;
  char c = read_char();
  while (c < '0' || c > '9') {
    if (c == '-') flag = true;
    c = read_char();
  }
  while (c >= '0' && c <= '9') {
    s = (s << 3) + (s << 1) + (c - '0');
    c = read_char();
  }
  return flag ? -s : s;
}
const int N = 2e5 + 5;
const int M = 2e5 + 5;
int w[N];
int End[M << 1], Last[N], Next[M << 1], Len[M << 1];
int e;
void addedge(int x, int y, int z) {
  End[++e] = y;
  Next[e] = Last[x];
  Last[x] = e;
  Len[e] = z;
  End[++e] = x;
  Next[e] = Last[y];
  Last[y] = e;
  Len[e] = z;
}
int f, g;
double c = 1e25, sum;
int size[N];
bool vis[N];
void dfs_find_g(int x, int fa, int n) {
  size[x] = 1;
  int max_size = 0;
  for (int i = Last[x]; i; i = Next[i]) {
    int y = End[i];
    if (!vis[y] && y != fa) {
      dfs_find_g(y, x, n);
      size[x] += size[y];
      max_size = ((max_size) < (size[y]) ? (size[y]) : (max_size));
    }
  }
  max_size = ((max_size) < (n - size[x]) ? (n - size[x]) : (max_size));
  g = max_size <= n >> 1 ? x : g;
}
double d[N];
void dfs(int x, int fa, int root, int dis) {
  double s = sqrt(dis);
  sum += w[x] * s * dis;
  d[root] += w[x] * 1.5 * s;
  for (int i = Last[x]; i; i = Next[i]) {
    int y = End[i];
    if (y != fa) dfs(y, x, root, dis + Len[i]);
  }
}
void solve(int x, int n) {
  dfs_find_g(x, 0, n);
  int u = g;
  vis[u] = true;
  sum = 0;
  double tot = 0;
  for (int i = Last[u]; i; i = Next[i]) {
    int v = End[i];
    d[v] = 0;
    dfs(v, u, v, Len[i]);
    tot += d[v];
  }
  if (sum < c) f = u, c = sum;
  for (int i = Last[u]; i; i = Next[i]) {
    int v = End[i];
    if (vis[v] || tot - 2 * d[v] >= 0) continue;
    solve(v, size[v] < size[u] ? size[v] : n - size[u]);
    break;
  }
}
int main() {
  int n = read_int();
  for (int i = 1; i <= n; i++) w[i] = read_int();
  for (int i = 1; i < n; i++) {
    int a = read_int(), b = read_int(), l = read_int();
    addedge(a, b, l);
  }
  solve(1, n);
  printf("%d %.8lf", f, c);
  return 0;
}
