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;
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch - '0' < 0 || ch - '0' > 9) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch - '0' >= 0 && ch - '0' <= 9) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n;
int a[200010];
int head[200010], nxt[200010 * 2], to[200010 * 2], c[200010 * 2], tot;
void add(int u, int v, int x) {
  tot++;
  nxt[tot] = head[u];
  head[u] = tot;
  to[tot] = v;
  c[tot] = x;
}
int f[200010], sum, size[200010], rt, vis[200010];
long long dis[200010];
void get_rt(int x, int las) {
  size[x] = 1;
  f[x] = 0;
  for (int i = head[x]; i; i = nxt[i]) {
    if (to[i] == las || vis[to[i]]) continue;
    get_rt(to[i], x);
    size[x] += size[to[i]];
    f[x] = max(f[x], size[to[i]]);
  }
  f[x] = max(f[x], sum - size[x]);
  if (f[x] < f[rt]) rt = x;
}
double g[200010];
double dfs(int x, int las) {
  g[x] = (double)a[x] * 1.5 * pow((double)dis[x], 0.5);
  double res = (double)a[x] * pow((double)dis[x], 1.5);
  for (int i = head[x]; i; i = nxt[i]) {
    if (to[i] == las) continue;
    dis[to[i]] = dis[x] + c[i];
    res += dfs(to[i], x);
    g[x] += g[to[i]];
  }
  return res;
}
double ans = 1e20;
int ansx;
void solve(int x) {
  vis[x] = 1;
  double res = dfs(x, 0);
  if (res < ans) ans = res, ansx = x;
  for (int i = head[x]; i; i = nxt[i]) {
    if (vis[to[i]]) continue;
    if (g[to[i]] - g[x] < 0) {
      sum = size[to[i]];
      rt = 0;
      get_rt(to[i], 0);
      solve(rt);
      return;
    }
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int q = read(), w = read(), e = read();
    add(q, w, e);
    add(w, q, e);
  }
  f[0] = 1000000007;
  sum = n;
  get_rt(1, 0);
  solve(rt);
  printf("%d %.8lf\n", ansx, ans);
  return 0;
}
