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>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
using namespace std;
char nc() { return getchar(); }
int read() {
  int x = 0, y = 1;
  char c = nc();
  while (!isdigit(c)) {
    if (c == '-') y = -1;
    c = nc();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = nc();
  }
  return x * y;
}
int n, head[200005], cnt = 0, v[200005];
struct edge {
  int next, to, value;
} a[200005 << 1];
void add(int x, int y, int z) {
  a[++cnt].next = head[x];
  a[cnt].to = y;
  a[cnt].value = z;
  head[x] = cnt;
}
int vst[200005], root, sz[200005], allsz;
void getroot(int x, int f) {
  sz[x] = 1;
  int tp = 0;
  for (int i = head[x]; i; i = a[i].next) {
    int t = a[i].to;
    if (vst[t] || t == f) continue;
    getroot(t, x);
    sz[x] += sz[t];
    tp = max(tp, sz[t]);
  }
  tp = max(tp, allsz - sz[x]);
  if (tp <= allsz / 2) root = x;
}
void getsz(int x, int f) {
  sz[x] = 1;
  for (int i = head[x]; i; i = a[i].next) {
    int t = a[i].to;
    if (vst[t] || t == f) continue;
    getsz(t, x);
    sz[x] += sz[t];
  }
}
int ansid;
double dis[200005], sm, sm2, ans = (1e100);
void dfs(int x, int f, int tp, int d) {
  sm += pow(d, 1.5) * v[x];
  dis[tp] += pow(d, 0.5) * 1.5 * v[x];
  for (int i = head[x]; i; i = a[i].next) {
    int t = a[i].to;
    if (t == f) continue;
    dfs(t, x, tp, d + a[i].value);
  }
}
void divide(int x) {
  if (vst[x]) return;
  vst[x] = 1;
  getsz(x, 0);
  sm = sm2 = 0;
  for (int i = head[x]; i; i = a[i].next) {
    int t = a[i].to;
    dis[t] = 0;
    dfs(t, x, t, a[i].value);
    sm2 += dis[t];
  }
  if (sm < ans) ans = sm, ansid = x;
  for (int i = head[x]; i; i = a[i].next) {
    int t = a[i].to;
    if (sm2 - dis[t] * 2 < 0) {
      allsz = sz[t];
      getroot(t, 0);
      divide(root);
      break;
    }
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) v[i] = read();
  int x, y, z;
  for (int i = 1; i < n; i++)
    x = read(), y = read(), z = read(), add(x, y, z), add(y, x, z);
  allsz = n;
  getroot(1, 0);
  divide(root);
  printf("%d %.10lf", ansid, ans);
  return 0;
}
